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.
Nondeterministic Turing Machine
See also
NP-Problem, Turing MachineExplore 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 MachineCite this as:
Weisstein, Eric W. "Nondeterministic Turing Machine." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/NondeterministicTuringMachine.html