“A theorem proven by Joel David Hamkins and Alexey Miasnikov establishes that the halting problem has a "black hole," meaning there is a computable procedure that correctly decides almost every instance of the problem.”