3 years ago

A Proof for P =? NP Problem.

Changlin Wan

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 within any given alphabet. As the concepts "Tao", "Yin" and "Yang" described in Chinese philosopy, an infinite sequence of TM, within any given alphabet, is constructed recursively, 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.

Publisher URL: http://arxiv.org/abs/1005.3010

DOI: arXiv:1005.3010v5

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.