Beginner
Theory of Computation
Q10 / 100
What is the Halting Problem?
Correct! Well done.
Incorrect.
The correct answer is B) The undecidable problem of determining whether a given Turing machine halts on a given input
B
Correct Answer
The undecidable problem of determining whether a given Turing machine halts on a given input
Explanation
Turing proved that no Turing machine can decide for all programs whether they halt. The proof uses diagonalization and is a cornerstone of computability theory.
Progress
10/100