2 ms·
Ok that makes sense. From a practical perspective, would this essentially make Turing machines obsolete in solving NP problems? Essentially does this mean that
by bglazer 12y ago
Ok that makes sense. From a practical perspective, would this essentially make Turing machines obsolete in solving NP problems?
Essentially does this mean that NP=P, in a non-Turing machine context?
- Sharlin 12y agoThere are plenty of formalisms that can solve all of NP in polynomial time. Problem is, they are all theoretical and there is no compelling reason to believe any of them can be actually constructed given the laws of physics.