factual
Halting Problem Decidable on a Set of Probability One
Hamkins and Miasnikov proved that although the halting problem is undecidable, for the one-way infinite tape Turing machine model it is decidable on a set of probability one: as program size grows, the proportion of programs whose halting status can be decided approaches 100%, because by Polya's recurrence theorem a random-walking head falls off the tape with probability one, though the result is fragile because it depends on the chosen computational model.
factualpending
Speaker
Joel HamkinsEvidence Quote
“the halting problem is decidable on a set of probability one. So you can decide almost every instance of the whole.”
Created: 6/13/2026, 12:16:57 AM
Your notes
Loading notes...