P is not equal to NP
Computational Complexity
2009-07-13 v2 Logic in Computer Science
Abstract
SAT is not in P, is true and provable in a simply consistent extension B' of a first order theory B of computing, with a single finite axiom characterizing a universal Turing machine. Therefore, P is not equal to NP, is true and provable in a simply consistent extension B" of B.
Cite
@article{arxiv.0810.5056,
title = {P is not equal to NP},
author = {Sten-Ake Tarnlund},
journal= {arXiv preprint arXiv:0810.5056},
year = {2009}
}
Comments
In the 2nd printing the proof, in the 1st printing, of theorem 1 is divided into three parts a new lemma 4, a new corollary 8, and the remaining part of the original proof. The 2nd printing contains some simplifications, more explanations, but no error has been corrected