Manifold cover image

Scott Aaronson: Quantum Computing, Unsolvable Problems, & Artificial Intelligence — #9

Manifold

CHAPTER

Is There a Fast Classical Algorithm for Factoring?

Do we really actually know what the octomal classical performance would be on those problems? Becauseo absolutely not. So factoring seems to inhabit likeaa twilight zone between and the n p complete problems. We have no excellent theoretical sons why it shouldn't be. But then, on the other hand, we also don't have a fast, classical algorithm for it. Aso lalets factor in n, digit number in time. And that special structure was enough for shore to design a quatemalgarithm to solve it. What we don't know is whether it's also enough to design a fast classical l you know now that there are classical algorithms for factoring that do better

00:00
Transcript
Play full episode

Remember Everything You Learn from Podcasts

Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.
App store bannerPlay store banner