A non-canonical example to support P is not equal to NP
- 74 Downloads
The more unambiguous statement of the P versus NP problem and the judgement of its hardness, are the key ways to find the full proof of the P versus NP problem. There are two sub-problems in the P versus NP problem. The first is the classifications of different mathematical problems (languages), and the second is the distinction between a non-deterministic Turing machine (NTM) and a deterministic Turing machine (DTM). The process of an NTM can be a power set of the corresponding DTM, which proves that the states of an NTM can be a power set of the corresponding DTM. If combining this viewpoint with Cantor’s theorem, it is shown that an NTM is not equipotent to a DTM. This means that “generating the power set P(A) of a set A” is a non-canonical example to support that P is not equal to NP.
KeywordsP versus NP computational complexity theory Cantor’s theorem power set continuum hypothesis
Unable to display preview. Download preview PDF.
- Cook S. The P versus NP Problem. Official Problem Description[EB/OL]. http://www.claymath.org/millennium/P_vs_NP/pvsnp.pdf, 2000.
- Encyclopaedia of China: Electronics and Computer[M]. Encyclopaedia of China Publishing House, Beijing, 1986 (in Chinese).Google Scholar
- The Clay Mathematics Institute. P vs NP Problem [EB/OL]., http://www.,claymath.,org/millennium/P_vs_NP/, 2000.
- Kuratowski K, Mostowski A. Set Theory[M]. North-Holland Publishing Company, Amsterdam, 1976.Google Scholar
- Hazewinkel M. Encyclopaedia of Mathematics: An Updated and Annotated Translation of the Soviet “Mathematical Encyclopaedia”[M]. Kluwer Academic Publishers, Dordrecht, 2001.Google Scholar
- Hopcroft J E, Motwani R M, Ullman J D. Introduction to Automata Theory, Languages and Computation[M]. 3 edition. Addison Wesley, New Jersey, 2006.Google Scholar
- Garey M R, Johnson D S. Computers and Intractability: A Guide to the Theory of NP-Completeness[M]. New York: W. H. Freeman, 1979.Google Scholar
- Nondeterministic, Turing, Machine[EB/OL]., http://mathworld.wolfram.com/NondeterministicTuringMachine.html, 2011.
- Encyclopaedia of China: Mathematics[M]. Encyclopaedia of China Publishing House, Beijing, 1988 (in Chinese).Google Scholar