M

Mr. Dubey • 97.30K Points
Coach

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

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.


Question analytics