Question

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

Answer 1

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.