The halting problem is decidable on a set of asymptotic probability one

Notre Dame Journal of Formal Logic

Volumn 47, Issue 4, 2006, Pages 515-524

  Hamkins, Joel David ^a,b   Miasnikov, Alexei ^c  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c MCGILL UNIVERSITY   (Canada)

Author keywords

Decidability; Halting problem; Turing machines

Indexed keywords

EID: 34247562018     PISSN: 00294527     EISSN: None     Source Type: Journal    
DOI: 10.1305/ndjfl/1168352664     Document Type: Article

References (3)

1. Feller, W., An Introduction to Probability Theory and Its Applications. Vol. I, 3d edition, John Wiley & Sons Inc., New York, 1968. Zbl 0155.23101. MR 0228020. 518
2. Pólya, G., "Über eine Aufgabe der Wahrscheinlichkeitsrechnung betreffend die Irrfahrt im Straßennetz," Mathematische Annalen, vol. 84 (1921), pp. 149-60. Zbl 48.0603.01. MR 1512028. 518
3. Soare, R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987. Zbl 0667.03030. MR 882921. 519