In: Computer Science
Show that the following problem i undecidable:
Input: A Turing machine M. Output: Yes if M eventually halts when started on a blank tape, no otherwise
Input: A Turing machine M and a tape symbol a. Output: Yes if M eventually writes a when started on an blank tape, no otherwise.
Input: A Turing machine M. Output: Yes if M ever writes a nonblank symbol when started on a blank tape, No otherwise.
Input: A Turing machine M and a string w over the input alphabet of M. Output: Yes if M ever moves to the left when started on w.
PLEASE LIKE IT RAISE YOUR THUMBS UP
IF YOU ARE HAVING ANY DOUBT FEEL FREE TO ASK IN COMMENT
SECTION