Question: Prove that the following question is undecidable. Given a Turing ma- chine M and state q of M, does M ever enter state q on

Prove that the following question is undecidable. Given a Turing ma- chine M and state q of M, does M ever enter state q on some input? (This problem is analogous to the problem of identifying dead code: given a PASCAL program containing a designated block of code, will that block of code ever be executed?)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
