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}
}
  • J. Zhou, Y. Li
  • Published 2019
  • Mathematics, Computer Science
  • ArXiv
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
1 Citations
Inquiry of P-reduction in Cook's 1971 Paper - from Oracle machine to Turing machine
  • PDF

References

SHOWING 1-8 OF 8 REFERENCES
The complexity of theorem-proving procedures
  • S. Cook
  • Mathematics, Computer Science
  • STOC '71
  • 1971
  • 6,212
  • Highly Influential
  • PDF
Computers and Intractability: A Guide to the Theory of NP-Completeness
  • 47,462
  • Highly Influential
  • PDF
Introduction to the Theory of Computation
  • 2,229
  • PDF
Introduction to the Theory of Computation
  • 202
  • Highly Influential
  • PDF
Why Philosophers Should Care About Computational Complexity
  • S. Aaronson
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2011
  • 68
  • PDF
On Computable Numbers, with an Application to the Entscheidungsproblem
  • 7,359
  • PDF
What is Turing Reducibility? November 2006 Notices of the AMS 1219
  • 2006
Nondeterministic and P vs