2. (25 points) Consider the language Li = {(M)M is a Turing machine that halts when started on the empty tape) Is Li є o? Justify your answer. , Show transcribed image text 2. (25 points) Consider the language Li = {(M)M is a Turing machine that halts when started on the empty tape) Is Li є o? Justify your answer. ,
Answer
Yes, because the language L1 is undecidable and
OR
OR