Consider the following problem X.
Given a Turing machine M over the input alphabet Σ, any
state q of M And a word w∈Σ*, does the computation of M
on w visit the state q?
Which of the following statements about X is correct?
Question 9-Explanation:
This problem is a State Entry Problem. State entry problem can be reduced to halting problem.
We construct a turing machine M with final state ‘q’. We run a turing machine R (for state entry problem)
with inputs : M, q, w .
We give ‘w’ as input to M.
If M halts in the final state ‘q’ then R accepts the input. So, the given problem is partially decidable.
If M goes in an infinite loop then M can not output anything. So, R rejects the input. So, the given problem becomes undecidable.
Thus, option (B) is the answer.
Please comment below if you find anything wrong in the above post.