Beginner
Theory of Computation
Q23 / 100
What does it mean for a language to be recursively enumerable (RE)?
Correct! Well done.
Incorrect.
The correct answer is B) There exists a Turing machine that accepts all strings in the language (but may loop on non-members)
B
Correct Answer
There exists a Turing machine that accepts all strings in the language (but may loop on non-members)
Explanation
RE languages are recognized (accepted) by Turing machines that always halt on accepted strings but may loop forever on rejected strings. Decidable languages always halt on both.
Progress
23/100