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. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability...
arxiv.org