Gate CS-2001 Question Paper With Solutions

Q. 32 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

Answer: (B)

Explanation:

Learn More:   Gate CS-2019 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here