A Proof for P =? NP Problem

Details A Proof for P =? NP Problem A Proof for P =? NP Problem

2010-05-17

arxiv.org/abs/1005.3010v4

Computer Science

Computational Complexity

10 pages, 1 figure

Scientific paper

The \textbf{P} =? \textbf{NP} problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for \textbf{P} =? \textbf{NP} problem. The central idea of this proof is a recursive definition for Turing machine (shortly TM) that accepts the encoding strings of valid TMs. By the definition, an infinite sequence of TM is constructed, and it is proven that the sequence includes all valid TMs. Based on these TMs, the class \textbf{D} that includes all decidable languages is defined. By proving \textbf{P}=\textbf{D}, the result \textbf{P}=\textbf{NP} is proven.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-299714