Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

They most certainly can't, not even close to it. They can do a very limited subset of problems, and not at all in one shot - just far far far less shots than a classical computer. But even if you reduce and O(e^n) problem to an O(n) or O(n²) problem, that's not instantaneous, and the speed with which you perform these n or n² operations still matters.


Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: