Abstract
The halting problem for Turing machines is decidable on a set of asymptotic probability one. The proof is sensitive to the particular computational models.
Citation
Joel David Hamkins. Alexei Miasnikov. "The Halting Problem Is Decidable on a Set of Asymptotic Probability One." Notre Dame J. Formal Logic 47 (4) 515 - 524, 2006. https://doi.org/10.1305/ndjfl/1168352664
Information
