Beginner
Theory of Computation
Q35 / 100
What does it mean for a problem to be undecidable?
Correct! Well done.
Incorrect.
The correct answer is B) No Turing machine can solve the problem for all inputs in finite time
B
Correct Answer
No Turing machine can solve the problem for all inputs in finite time
Explanation
An undecidable problem has no algorithm that always terminates with the correct answer. This is a fundamental limitation of computation, not just current hardware.
Progress
35/100