Beginner
Theory of Computation
Q11 / 100
What is a decidable language?
Correct! Well done.
Incorrect.
The correct answer is B) A language for which there exists a Turing machine that always halts and correctly accepts or rejects any input
B
Correct Answer
A language for which there exists a Turing machine that always halts and correctly accepts or rejects any input
Explanation
A decidable (recursive) language has a Turing machine that halts on all inputs — returning "accept" or "reject." Undecidable problems (like the Halting Problem) have no such TM.
Progress
11/100