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.
Original language | English |
---|---|
Pages (from-to) | 515-524 |
Number of pages | 10 |
Journal | Notre Dame Journal of Formal Logic |
Volume | 47 |
Issue number | 4 |
DOIs | |
State | Published - 2006 |
Keywords
- Decidability
- Halting problem
- Turing machines