论文信息 - The Halting Problem Is Decidable on a Set of Asymptotic Probability One

The Halting Problem Is Decidable on a Set of Asymptotic Probability One

The halting problem for Turing machines is decidable on a set of asymptotic probability one. The proof is sensitive to the particular compu- tational model.

Joel David Hamkins | Alexei G. Myasnikov

[1] B. Harshbarger. An Introduction to Probability Theory and its Applications, Volume I , 1958 .

[2] R. Soare. Recursively enumerable sets and degrees , 1987 .

[3] Frank E. Grubbs,et al. An Introduction to Probability Theory and Its Applications , 1951 .

[4] G. Pólya. Über eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Straßennetz , 1921 .

[5] D. V. Lindley,et al. An Introduction to Probability Theory and Its Applications. Volume II , 1967, The Mathematical Gazette.