Abstract

A pair of C functions are defined such that D has the halting problem proof's pathological relationship to simulating termination analyzer H. When H correctly determines that D correctly simulated by H must be aborted to prevent its own infinite execution then H is necessarily correct to reject D as specifying non-halting behavior. This exact same reasoning is applied to the Peter Linz Turing machine based halting problem proof.