Classical computers are very versatile devices, and there is nothing to say that someone may not find a very clever classical algorithm that could solve the hardest problems like integer factorization more efficiently than currently known algorithms; people think it is very unlikely, but it is not ruled out.
factualpending
Speaker
Unidentified Speaker — The Map of Quantum Computing - Quantum Computing Explained [-UlxHPIEVqA]Evidence Quote
“But I should be careful here to make sure I don't mischaracterize classical computers. They are very versatile devices, and there is nothing to say that someone may find a very clever classical algorithm that could solve the hardest problems like integer factorization more efficiently.”
Created: 8/10/2026, 10:45:18 PM
Your notes
Loading notes...