factual

Halting Problem Has a Black Hole

Although the halting problem is undecidable, it has a 'black hole': there is a computable procedure that correctly decides almost every instance, because the asymptotic density of programs whose head falls off the tape (via random-walk behavior, by Pólya's recurrence theorem) before repeating a state goes to 100% as the number of states grows.

factualpending

Speaker

Joel David Hamkins

Evidence Quote

“there's a computer procedure that decides correctly almost every instance of the halting problem. Even though the halting problem is not decidable, we can decide almost every instance... as the number of states becomes large, the proportion of programs in the collection goes to 100%.”

Source

Joel David Hamkins— Lex Fridman Podcast
Created: 6/13/2026, 3:33:58 AM

Your notes

Loading notes...