可计算性与不确定性以及P与NP
Computability vs. Nondeterministic and P vs. NP
摘要:
本文论证了可计算性与不确定性的相关性,不确定性是图灵的不可判定性,而不是不确定性的多项式时间。在分析TM、UM、DTM、NTM、Turing可约、Beta-约化、P-可约化、同构、重言式、半可判定、检验关系、预言机和NP-完全性等问题的基础上,它重新解释了Church-Turing命题,它等价于多项式时间和实际时间;它重新定义了NTM基于其内部状态的不可判定集合。它得出的结论是:P-可约性是从图灵可约性及其预言的误导; NP-完全性是丘奇-图灵命题的逆转;库克-莱文定理是两个不确定性的等价。本文提出了NP(nondeterministic problem)和NP-算法(NP-algorithm)的概念。P与NP是可计算性与不确定性的相对性,P/=NP。NP-算法是利用TM逼近NP的有效途径。
英文摘要:
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing Reducible, beta-reduction, P-reducible, isomorph, tautology, semi-decidable, checking relation, the oracle and NP-completeness, etc., it reinterprets The Church-Turing Thesis that is equivalent of the Polynomial time and actual time; it redefines the NTM based on its undecidable set of its internal state. It comes to the conclusions: The P-reducible is misdirected from the Turing Reducible with its oracle; The NP-completeness is a reversal to The Church-Turing Thesis; The Cook-Levin theorem is an equipollent of two uncertains. This paper brings forth new concepts: NP (nondeterministic problem) and NP-algorithm (defined as the optimal algorithm to get the best fit approximation value of NP). P versus NP is the relativity of Computability and Nondeterministic, P/=NP. The NP-algorithm is effective approximate way to NP by TM.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。