Delete comment from: Computational Complexity
Anon #29
So you verified the correctness of the proof. That's computing: data in, information out, garbage in, garbage out and paradox in, paradox out. Give the Turing machine the Kleene-Rosser paradox as an input, you prove:P=NP iff P!=NP. Thanks a lot.
Sep 8, 2010, 3:27:27 PM
Posted to How to Write Up Major Results