You are currently offline. Some features of the site may not work correctly.

Corpus ID: 67856368

Interpretation of NDTM in the definition of NP

@article{Zhou2019InterpretationON,
title={Interpretation of NDTM in the definition of NP},
author={J. Zhou and Y. Li},
journal={ArXiv},
year={2019},
volume={abs/1903.00355}
}

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… Expand