Teaching TN TRB CS Mock Test Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Undecidability
If L is recursive language and L̅ is recursively enumerable language, then which of the following is true?
1
L is recursively enumerable language
2
L̅ is recursive language
3
Both 1 and 2
4
None of these