Radar🚨
@RadarHits 2h
BREAKING: ‼️🤖
Google makes quantum computing breakthrough with new chip capable of solving computational problems in under 5 minutes, that would otherwise take the leading supercomputer: 10,000,000,000,000,000,000,000,000 years
Dec 9, 2024 · 8:40 PM UTC
If it takes that long to compute how does anyone even know if what was shown is remotely even accurate?
well the loading bar, duh :D
First time I've ever wanted to up-toot someone here more than once. Well done. 👍
I’m still waiting… can’t even tell if it’s moving.
because so far, it hasn't been shown that P=NP
For example, cracking encryption keys takes that long, and verification of results takes seconds.
There is an entire category of problems described by P = NP. What this means is that the solution itself can be computed in non-polynomial time, but the solution can be verified in polynomial time. The time it takes to compute the solution is different from the time it takes to verify the solution.
Now that is the right question.