P is not equal to NP

Details P is not equal to NP P is not equal to NP

2008-10-28

arxiv.org/abs/0810.5056v2

Computer Science

Computational Complexity

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,

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

P is not equal to NP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with P is not equal to NP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P is not equal to NP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-486044