What is the computational complexity of the Halting Problem?
Asked In:
BPSC TRE 3.0
Options
-
A.
O(1)
-
B.
O(n)
-
C.
Not computable
-
D.
More than one of the above
-
E.
None of the above
Correct Answer (Detailed Explanation is Below)
C.
Not computable
Detailed Explanation
- Halting Problem: Determines whether a given program or Turing Machine will eventually halt or run forever for a particular input.
- Alan Turing: Proved in 1936 that the general Halting Problem is undecidable.
- Not Computable: No algorithm can correctly solve the general Halting Problem for all possible program-input pairs.
- Exam Point: It is an undecidable problem, not an O(1) or O(n) complexity problem.
OOps! You are currently offline.