2 citations · 3 across the 9 of their papers we have counts for
1 paper · 1 filter
Joel David Hamkins, Alexei Miasnikov
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptoti…