Have you ever written a program that incorrectly looped forever? or one that deadlocked? or had any such other liveness bugs? I can't speak for you, but I cert

Have you ever written a program that incorrectly looped forever? or one that deadlocked? or had any such other liveness bugs? I can't speak for you, but I certainly have, and, if the questions on stackoverflow are to be considered representative of typical humans, then it seems most other programmers have also done this at some point in their lives. In general, human answers to halting problems have no guarantees of soundness or completeness, and can't be guaranteed to be correct unless presented as some kind of proof in some kind of logic. Then, if a human can use some logic system to guarantee that a particular program halts, then a turing machine could also trivially solve this problem, by simply enumerating and verifying the possible proofs of program in the logic system. This proof strategy has further benefits beyond ad-hoc human reasoning, in that it is guaranteed to eventually find the proof if it exists.