M

Mr. Dubey • 52.30K Points
Coach 

Q. Halting problem is an example for?

(A) decidable problem
(B) undecidable problem
(C) complete problem
(D) trackable problem
Correct : Option (B)

Explanation: 
 halting problem by alan turing cannot be solved by any algorithm. hence, it is undecidable.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. "Doing the right things" is referred to as .

Q. A condition is referred to as

Q. Which one of the following deletes all the entries but keeps the structure of the relation.

Q. Your company has a LAN in its downtown office and has now set up a LAN in the manufacturing plant in the suburbs. To enable everyone to share data and

Q. All of the follwing are suitable problem for genetic algorithm EXCEPT

Q. A search key containing more than one attribute is referred to as a _________ search key.

Q. A graph in which all vertices have equal degree is known as ____

Q. Which of the following techniques used to effectively utilize main memory?

Q. What types of errors are missed by black-box testing and can be uncovered by whitebox testing?

Q. When only costs are involved, the AE method is sometimes called the annual equivalent cost method.