Consider <M> be the encoding of a Turing Machine as a string over alphabet Σ = {0, 1}. Consider L = {<M>⏐M is TM that halt on all input and L(M) = L′ for some undecidable language L′}. Then L is ....
can anyone explain the sentence in Bold and bold & italics ??
i didnt get L(M).