“The halting problem, which asks whether a given computer program will ever halt, is computably undecidable, as proven by Alan Turing.”