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

Explore with Wolfram|Alpha

More things to try:

• 5-ary Lyndon words of length 12
• Fourier transform exp(-x^2)
• inflection points (x^5+x^9-x-1)^3

References

Referenced on Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Nondeterministic TuringMachine." FromMathWorld--A Wolfram Resource.https://mathworld.wolfram.com/NondeterministicTuringMachine.html

Subject classifications