Halting Problem
← Back to Undecidable Problems
The problem of determining whether a given program will halt or run forever on a given input. Proved undecidable by Alan Turing in 1936 via a diagonalization argument. The most famous undecidable problem, establishing fundamental limits on what computers can compute.
computational-complexity complexity-classes undecidable halting-problem