Question: Given a TM, T 1 , and any string w, there is clearly a TM, T 2 , that first screens its input to see
Given a TM, T1, and any string w, there is clearly a TM, T2, that first screens its input to see whether it is the particular string w; if it is not the input is accepted, if it is w, then T1 is run on the input w. Pictorially,

Show that there is no decision procedure to determine whether any given TM (say T2) accepts all strings or not.
Input T2 Is it w? Yes 2 No Run T HALT
Step by Step Solution
3.41 Rating (173 Votes )
There are 3 Steps involved in it
There is no decision procedure to determine whether any g... View full answer
Get step-by-step solutions from verified subject matter experts
