Q. 88 Define languages L0 and L1 as follows
Here< M,w, i > is a triplet, whose first component. M is an encoding of a Turing
Machine, second component,w, is a string, and third component, t , is a bit.
Let L = L0 , L1. Which of the following is true?
(A) L is recursively enumerable, but L is not
(B) L is recursively enumerable, but L is not
(C) Both L and L are recursive
(D) Neither L nor L is recursively enumerable
Answer: (D)
Explanation:
