2 votes
Accepted

Turing Machine writes "a" for every input w is undecidable

Your suspicion is well-founded. The point 4 is invalid. Imagine the exact moment N "writes 'a' on the tape and reject" in the point 4. That means at that moment, it is known that M loops. ...
user avatar
  • 34k

Only top scored, non community-wiki answers of a minimum length are eligible