A Solution to the P versus NP Problem

Details A Solution to the P versus NP Problem A Solution to the P versus NP Problem

2010-11-11

arxiv.org/abs/1011.2730v23

Computer Science

Computational Complexity

This paper has been withdrawn by the author due to a flaw in the Theorem 5.1

Scientific paper

The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the separation of P from NP. If a language is not recursive, it can't belong to the complexity class NP. We find a problem in NP which is not in P; because if it would be present in that class, then it will imply that some undecidable problem will be in NP too. That's why it can be confirmed by reduction ad absurdum the following result: P doesn't equal NP. This new problem named Certifying is to find a possible input given a particular deterministic Turing machine named Certified Turing machine and its output.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-431540