Consider a language L for which there exists a Turing machine ™, T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is

Home / Engineering / Theory of Computation / Question

Mr. Dubey • 51.17K Points
Coach

Q.) Consider a language L for which there exists a Turing machine ™, T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is

(A) NP hard

(B) NP complete

(D) Recursively enumerable

Correct answer : Option (D) - Recursively enumerable

Discusssion

Related MCQs on Theory of Computation

Q. Before a disk can be used to store data. It must be_______

Q. Which of these is not applicable for IP protocol?

Q. Stack can be reversed without using extra space by

Q. CMM stands for

Q. If the semaphore value is negative ____________.

Q. You have 3 dice each having 6 faces. What is the number of permutations that can be obtained when you roll the 3 dice together?

Q. If a system is 64 bit machine, then the length of each word will be

Q. In the classical chief programmer team approach, the team member responsible for maintaining the detailed design and coding is

Q. Multiplexing provides _________

Q. Which of these software engineering activities are not a part of software processes?