Consider the following problem X “Given a Turing Machine M over the input…
Coal India Management Trainee CBT · 2019 · 2020 Systems · Paper II · Domain KnowledgeGATE · 2001 · CS · Question 2 subparts
Consider the following problem X
“Given a Turing Machine M over the input alphabet Σ any state q of M and word Σ*, does the computation of M on w visit the state q”
Which of the following X is correct?
- A.
X is undecidable but partially decidable
- B.
X is not a decision problem
- C.
X is decidable
- D.
X is undecidable but not even partially decidable
Attempted by 222 students.
Sign up free to check your answer
Sign up freeLoading lesson…