Nondeterministic Turing machine
In theoretical computer science, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than one possible action when in some given situations. That is, an NTM's next state is not completely determined by its action and the current symbol it sees, unlike a deterministic Turing machine.
Nondeterministic Turing machine - Wikipedia Jump to content From Wikipedia, the free encyclopedia Theoretical model of computation Turing machines Machine Turing machine equivalents Turing machine examples Variants Alternating Turing machine Neural Turing machine Nondeterministic Turing machine Quantum Turing machine Post–Turing machine Probabilistic Turing machine Multitape Turing machine Multi-track Turing machine Symmetric Turing machine Total Turing machine Unambiguous Turing machine Universal Turing machine Zeno machine Science Alan Turing Category:Turing machine v t e In theoretical comp
Explore this link on the map →saved by
related reading
- Complexity class - Wikipediaen.wikipedia.org
- Decision problem - Wikipediaen.wikipedia.org
- True quantified Boolean formula - Wikipediaen.wikipedia.org
- Turing machine - Wikipediaen.wikipedia.org
- Turing Machines | Brilliant Math & Science Wikibrilliant.org
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Turing Machinessamwho.dev
- Quantum computing for the very curiousquantum.country
- alan turing - computing machinery and intelligencecourses.cs.umbc.edu
- Turing completeness - Wikipediaen.wikipedia.org
- NP (complexity) - Wikipediaen.wikipedia.org
- Accidentally Turing-Completebeza1e1.tuxen.de