TOPICS
Search

Nondeterministic Turing Machine


A nondeterministic Turing machine is a "parallel" Turing machine that can take many computational paths simultaneously, with the restriction that the parallel Turing machines cannot communicate.


See also

NP-Problem, Turing Machine

Explore with Wolfram|Alpha

References

Wolfram, S. A New Kind of Science. Champaign, IL: Wolfram Media, pp. 766-769, 2002.

Referenced on Wolfram|Alpha

Nondeterministic Turing Machine

Cite this as:

Weisstein, Eric W. "Nondeterministic Turing Machine." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/NondeterministicTuringMachine.html

Subject classifications