2 ms·
Computers are ideally non-deterministic, but due to NP-completeness, they can't predict their own results.
by posterboy 8y ago
Computers are ideally non-deterministic, but due to NP-completeness, they can't predict their own results.
- tsimionescu 8y agoIt's actually due to the undecidability results that there can't be a general algorithm to predict the result of any algorithm. If the problem were merely NP-complete, it would mean that, as far as we know, it would take a very long time to do it, but it would still possible.