The Halting Problem Is Decidable on a Set of Asymptotic Probability One
source link: https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-47/issue-4/The-Halting-Problem-Is-Decidable-on-a-Set-of-Asymptotic/10.1305/ndjfl/1168352664.full
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
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
Recommend
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK