Halting Problem

Home > Languages > Formal Language > Turing Machines > Halting Problem

The halting problem is the problem of determining whether a given program will halt or run forever. It is an unsolvable problem, proven by Turing in his proof of the undecidability of the Halting Problem.