UTpaper

Free mock tests & test series

Question 103Asked in CIL MT Systems, 27 Feb 2020 (8:00 AM)

Consider the following problem X "Given a Turing Machine M over the input alphabet Σ any state q of M and word w in Σ*, does the computation of M on w visit…

Consider the following problem X "Given a Turing Machine M over the input alphabet Σ any state q of M and word w in Σ*, does the computation of M on w visit the state q" Which of the following X is correct?
  1. AX is undecidable but partially decidable
  2. BX is not a decision problem
  3. CX is decidable
  4. DX is undecidable but not even partially decidable
Show answerHide answer

Correct answer: (A) X is undecidable but partially decidable

From CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM)

This is question 103 of CIL MT Systems PYQ, 27 Feb 2020 (8:00 AM). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.