A recursively ennumerable language L can be recursive if: A.

a-recursively-ennumerable-language-l-can-be-recursive-if-a

A recursively ennumerable language L can be recursive if:

A. L’ is recursively ennumerable

B. Every possible sequence of moves of T, the TM which accept L, causes it to halt

C. Both A. and B.

D. None of the mentioned

I got this question during an online exam.

I need to ask this question from The Language of Turing Machine-2 topic in chapter Introduction to Turing Machines of Automata Theory

Correct choice is C. Both A. and B.

Explanation: Theorem- If L is a recursively ennumerable language whose complement is recursively ennumerable, then L is recursive.