Halting problem

The halting problem is a fundamental decision problem in computability theory that asks whether a given program will eventually stop running or continue to run forever, and is famously proven to be undecidable.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.