Define languages L0 and L1 as follows :
L0={⟨M,w,0⟩∣M halts on w}
L1={⟨M,w,1⟩∣M does not halt on w}
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 the third component i is a bit.
Let L= L0 ∪ L1. Which of the following is true?
L is not even recursively enumerable as we cannot even design an acceptor for L as even when L0 is RE L1 is not RE
but can anyone explain me what about L COMPLEMENT what is the language ??