>>9910596
bumping schizo thread
the halting problem is specifically the turing machine halting problem, and it deals with turing machines (and by extension, equivalent computing models). Probabilistic proofs are irrelevant since it is possible to check in linear time if 99% of turing machines will halt or not in some input, the proof is about those edge cases.
That is, for any method you build that determines whether a program will halt or not, you can make a pair of program and input that will contradict the result of the method. In your case, any function inserted in DoAThing that takes more than 1010 steps to complete will always be considered as non halting, even if it always halts