ConceptNondeterministic Turing Machine / NTM
Nondeterministic Turing Machine
A theoretical model of computation in which multiple possible transitions may be taken at each step. It accepts an input if any accepting path exists, and it is used to define the class NP of problems.
Timeline (last 90 days)
Nov 2
A nondeterministic Turing machine can guess multiple possible transitions at each step, and the input is considered accepted as long as there exists an accepting path.
Unverified50%