If an elderly but distinguished scientist says that something is possible, he is almost certainly right; but if he says that it is impossible, he is very probably wrong.
... but if a mathematician involved in algorithms says that something is NP-complete, he is almost certainly correct: both that it is NP-complete and that it won't be solved on your computer.
2 comments:
... but if a mathematician involved in algorithms says that something is NP-complete, he is almost certainly correct: both that it is NP-complete and that it won't be solved on your computer.
Let's see how quantum computing, which is just around the corner, fares.
Post a Comment