M

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

Previous

Next

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. __________ is a statement of expected results in numerical terms.

Q. CMOS circuits are extensively used for ON-chip computers mainly because of their extremely

Q. In open-loop control, policies are applied to __________

Q. The data structure which is one ended is ………………

Q. 43')

Q. A joystick is consisting of a

Q. DA stands for:

Q. Which among the following involves in planning process?

Q. Fail safe is

Q. Who formulated Chan’s algorithm?