NP定义中NDTM的解释
Interpretation of NDTM in the definition of NP
摘要:
本文通过对NP的溯源,解释了用于定义NP的NDTM(非确定性图灵机)。在Cook定理中NP被定义为可由NDTM在多项式时间内求解的一类问题,NDTM被表示为本质上是Oracle的查询机。后来提出了一个由猜测模块和检查模块组成的模型来代替NDTM。这种本质TM模型与本质Oracle的NDTM模型有着本质的区别,但人们仍然用NDTM来表示这种模型,这就导致了NDTM的变相置换,并产生了NP的基于验证者的定义,即NP是可由TM(图灵机)在多项式时间内验证的问题类。这个基于验证者的定义后来被接受为NP的标准定义,它来自于NP的两个定义的著名等价性。从那时起,非决定性的概念从NP中消失了,这导致了对NP理解的模糊性,从而给解决P对NP问题带来了巨大的困难。由于NP最初与图灵关于可计算性的工作所产生的Oracle相关,因此,追溯图灵的工作并进一步澄清NP问题显得十分必要。
英文摘要:
In this paper, we interpret NDTM (NonDeterministic Turing Machine) used to define NP by tracing to the source of NP. Originally NP was defined as the class of problems solvable in polynomial time by a NDTM in the theorem of Cook, where the NDTM was represented as Query Machine of essence Oracle. Later a model consisting of a guessing module and a checking module was proposed to replace the NDTM. This model of essence TM has a fundamental difference from the NDTM of essence Oracle, but people still use the term NDTM to designate this model, which leads to the disguised displacement of NDTM and produces out the verifier-based definition of NP as the class of problems verifiable in polynomial time by a TM (Turing Machine). This verifier-based one has been then accepted as the standard definition of NP where comes from the famous equivalence of the two definitions of NP. Since then the notion of nondeterminism is lost from NP, which causes ambiguities in understanding NP and then great difficulties in solving the P versus NP problem. Since NP is originally related with Oracle that comes from the work of Turing work about Computability, it seems quite necessary to trace back to the work of Turing and clarify further the issue about NP.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。