5 ms·
They are guarding themselves against charges that they have claimed something which they haven't (to have proven that NP = P in the standard Turing machine cont
by Chinjut 12y ago
They are guarding themselves against charges that they have claimed something which they haven't (to have proven that NP = P in the standard Turing machine context, and thus earnt the accolades which would accompany the resolution of this longstanding mathematical problem).
- bglazer 12y agoOk 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.