∈P is true, and provable in a simply consistent extension B′ of a first order theory B of computing, with a single finite axiomB characterizing a universal Turing machine. Therefore P !=NP is true, and
provable in a simply consistent extension B′′ of B.
How can something be "new" and "improved"? if it's new, what was it improving on?

LinkBack URL
About LinkBacks





