closed by
877 views
0 votes
0 votes
closed as a duplicate of: turing machine plzz xplain

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).

closed by

Related questions

2 votes
2 votes
2 answers
2
rahul sharma 5 asked Aug 7, 2017
650 views
Check whether the language below is recursive, recursively enumerable but not recursive, or not recursively enumerable?{⟨M1,M2⟩∣ M1 and M2 are two TMs, and ϵ∈L(M...
0 votes
0 votes
0 answers
3
SeemaTanwar asked Dec 27, 2016
251 views
L1={<M>|M is a TM and |L(M)|<=3}L2={<M>|M is a TM and |L(M)|>=3}L3={<M>|M is a TM and L(M) is finite}How can we judge which language is rec, R. E or not R. E?