All I have to do to defeat your refutation is to defeat your halting decider.PeteOlcott wrote: ↑Fri May 13, 2022 5:16 am All that I have to do to refute all of the conventional Halting problem proofs is defeat this one case:
For any program H that might determine if programs halt, a "pathological" program P, called with some input, can pass its own source and its input to H and then specifically do the opposite of what H predicts P will do. No H can exist that handles this case.
https://en.wikipedia.org/wiki/Halting_problem
What part of this is confusing you? Every H has a degenerate case! Which can be crafted specifically to defeat H!