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?
A)X is decidable
B)X is undecidable but partially decidable
C)X is undecidable and not even partially decidable
D)X is not a decision problem

Question

Quizplus · Accepted Answer

The problem is decidable because we can simulate the Turing machine on the input word and check if the state q is visited during the computation.

Consider the Following Problem X