Let L = { y = {0,1}* | y = code(M) for some Turing Machine M and M halts on no input}

How can I prove whether this language recognizable or unrecognizable?

  • $\begingroup$ We're not looking for posts that consist solely of the text of an exercise-style task. What are your thoughts? We're happy to help you understand the concepts but just solving exercises for you is unlikely to achieve that. You might find this page helpful in improving your question. $\endgroup$
    – D.W.
    Commented Apr 21, 2023 at 23:47
  • $\begingroup$ @D.W. this is definitely not a home work question but thank you for your comment. I modified the question as well. I am interested in the process of creating such proof. $\endgroup$
    – Sam333
    Commented Apr 22, 2023 at 9:15


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.