Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
A language L for which there exists a TM ‘T’, that accepts every word in L and either rejects or loops for every word that is not in L, is said to be
1
Recursive
2
Recursively enumerable
3
NP-HARD
4
None of the above