A

Admin • 832.70K Points
Coach

Q. Halting problem is an example for?

  • (A) decidable problem
  • (B) undecidable problem
  • (C) complete problem
  • (D) trackable problem

Explanation by: Admin

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

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.