Refutation of halting problem proofs for high school students

[olcott]

I am actually refuting the conclusion of the halting problems proofs.
The halting problem proofs do not really show that the halting problem
is undecidable.

void H_Hat(u32 P)
{
if (!Halts(P, P)) // If it does not halt then
HALT // halt
else // if it halts then
HERE: goto HERE; // loop forever
}

The generic strategy of all of the conventional halting problem proofs
is implemented in the above program: Make an input program:
"Do the opposite of whatever the halt decider decides".

This solution circumvents the method of the proofs by not making the
halting decision until after the input programs has already stopped
running.

If the input program has already stopped running before the halt decider
makes its decision then the input program cannot possibly:
"Do the opposite of whatever the halt decider decides".


void H(u32 P, u32 I)
{
if (Non_Halting_Detected_While_Running_it(P, I))
{
Stop running it.
Report Non Halting Detected. // Does not halt
}
else
Report that it already stopped running. // Halts
}




--
Copyright 2020 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre
minds." Einstein