Home / Engineering / Theory of Computation / Question

Q.) Consider a language L for which there exists a Turing machine ™, T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is

(A) NP hard
(B) NP complete
(C) Recursive
(D) Recursively enumerable
Correct answer - Option (D) -
Recursively enumerable

Share

Discusssion

Login to discuss.