From Mr Flibble@21:1/5 to All on Fri Apr 18 18:32:43 2025
Hi!
I, aka Mr Flibble, have created a new computer science term, the
"Unpartial Halt Decider". It is a Halt Decider over the domain of all
*finite* program-input pairs excluding pathological input (a manifestation
of the
self referencial category error).
A simulating halt decider of the unpartial type *with infinite resources* solves the halting problem as corrected to exclude the self referencial category error.
Turing’s statement of the problem included logically invalid inputs. Once
we correct the domain to disallow self-reference, the rest (of *finite*
size) are decidable.