Beginner
Theory of Computation
Q36 / 100
What is a nondeterministic Turing machine (NTM)?
Correct! Well done.
Incorrect.
The correct answer is B) A TM that can branch into multiple computation paths simultaneously, accepting if any path accepts
B
Correct Answer
A TM that can branch into multiple computation paths simultaneously, accepting if any path accepts
Explanation
An NTM explores multiple paths of computation simultaneously. While not physically realizable, it is theoretically equivalent to deterministic TMs in terms of language recognition (though potentially exponentially faster).
Progress
36/100