P != NP Proof

Details P != NP Proof P != NP Proof

2009-07-23

arxiv.org/abs/0907.3965v60

Computer Science

Computational Complexity

24 pages and 3 new revolutionary ideas. Please: If possible, read the paper without preconceptions. Remember that, compared to

Scientific paper

This paper demonstrates that P \not= NP. The way was to generalize the traditional definitions of the classes P and NP, to construct an artificial problem (a generalization to SAT: The XG-SAT, much more difficult than the former) and then to demonstrate that it is in NP but not in P (where the classes P and NP are generalized and called too simply P and NP in this paper, and then it is explained why the traditional classes P and NP should be fixed and replaced by these generalized ones into Theory of Computer). The demonstration consists of: 1. Definition of Restricted Type X Program; 2. Definition of the General Extended Problem of Satisfiability of a Boolean Formula - XG-SAT; 3. Generalization to classes P and NP; 4. Demonstration that the XG-SAT is in NP; 5. Demonstration that the XG-SAT is not in P; 6. Demonstration that the Baker-Gill-Solovay Theorem does not refute the proof; 7. Demonstration that the Razborov-Rudich Theorem does not refute the proof; 8. Demonstration that the Aaronson-Wigderson Theorem does not refute the proof.

Affiliated with

Also associated with

No associations

Rating

P != NP Proof 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 != NP Proof, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and P != NP Proof will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-354439