halting problem
In computability theory, the problem of determining whether a given program will eventually halt or run forever. A fundamental undecidable problem.
The halting problem is the problem of determining whether a Turing machine will halt.
The undecidability of the halting problem was proved by Alan Turing.