An undecidable problem of computability. As there are denumerably many programs (or computable functions), such programs can be counted and assigned a Gödel number. The halting problem asks whether the ith program terminates when run with the ith input, but no algorithm can decide this.