πŸ“Š Design and Analysis of Algorithms
Q. Halting problem is an example for?
  • (A) decidable problem
  • (B) undecidable problem
  • (C) complete problem
  • (D) trackable problem
πŸ’¬ Discuss
βœ… Correct Answer: (B) undecidable problem

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


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

πŸ’¬ Discussion

πŸ“Š Question Analytics

πŸ‘οΈ
234
Total Visits
πŸ“½οΈ
2 y ago
Published
πŸŽ–οΈ
Mr. Dubey
Publisher
πŸ“ˆ
89%
Success Rate