Q2.7

MCQ2 marks, −0.5

Consider the following problem $X$ . Given a Turing machine $M$ over the input alphabet $\Sigma$ , any state $q$ of $M$ and a word $w \in \Sigma^*$ , does the computation of $M$ on $w$ visit the state of $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

Loading…