The error of the halting problem

For any program H that might determine whether programs halt, a
"pathological" program D, called with some input, can pass its own
source and its input to H and then specifically do the opposite of what
H predicts D will do. No H can exist that handles this case. https://en.wikipedia.org/wiki/Halting_problem
The way that the halting problem is conventionally understood is that H
must correctly answer yes or no to an input that contradicts both
answers, thus H is being asked a question isomorphic to the Liar
Paradox: Is this sentence true or false: "This sentence is not true." ?
*Two PhD computer science professors agree with this assessment*
E C R Hehner. Problems with the Halting Problem, COMPUTING2011 Symposium on 75 years of Turing Machine and Lambda-Calculus, Karlsruhe Germany, invited, 2011 October 20-21; Advances in Computer Science and Engineering v.10 n.1 p.31-60, 2013
https://www.cs.toronto.edu/~hehner/PHP.pdf
Bill Stoddart. The Halting Paradox
20 December 2017
https://arxiv.org/abs/1906.05340
arXiv:1906.05340 [cs.LO]
E C R Hehner. Objective and Subjective Specifications
WST Workshop on Termination, Oxford.  2018 July 18.
See https://www.cs.toronto.edu/~hehner/OSS.pdf
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer