2 ms·
It'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-co
by tsimionescu 8y ago
It'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.