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?

Home / Engineering / Theory of Computation / Question

Mr. Dubey • 51.38K 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

(D) X is not a decision problem

Correct answer : Option (A) - X is decidable

Discusssion

Related MCQs on Theory of Computation

Q. The tar command in UNIX

Q. Predict the output of following python programs dictionary1 = {'Google' : 1, 'Facebook' : 2, 'Microsoft' : 3 } dictionary2 = {'GFG' : 1, 'Microsoft' : 2, 'Youtube' : 3 } dictionary1.update(dictionary2); for key, values in dictionary1.items(): print(key, values)

Q. The file once created can not be changed is called ___________

Q. Reliability of software is dependent on number of errors

Q. Where does a web application reside?

Q. Application level gateway firewalls are also used for configuring cache-servers.

Q. Attach additional responsibilities to an object dynamically.It provides a flexible alternative to subclassing for extending functionality.

Q. the BlockPerGrid and ThreadPerBlock parameters are related to the ________ model supported by CUDA.

Q. Which of the following allocates/deallocates buffers

Q. The physical layer provides