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
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.