Delete comment from: Computational Complexity
As above, you don't need my proof to establish P=NP iff P!=NP. What does it mean the (inconsistent) lambda calculus is equivalent to Turing machines other than this?
Again forget about my proof. What does it mean that the (inconsistent) lambda-calculus is equivalent to Turing machines for everybody here???
Sep 4, 2010, 1:37:00 PM
Posted to Intelligent questions about the alleged P NE NP proof