Re: Halting Problem: What Constitutes Pathological Input

On 5/5/2025 10:17 AM, Mr Flibble wrote:

What constitutes halting problem pathological input:
 Input that would cause infinite recursion when using a decider of the
simulating kind.
 Such input forms a category error which results in the halting problem
being ill-formed as currently defined.
 /Flibble

I prefer to look at it as a counter-example that refutes
all of the halting problem proofs.
int DD()
{
   int Halt_Status = HHH(DD);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
}
https://github.com/plolcott/x86utm
The x86utm operating system includes fully
operational HHH and DD.
https://github.com/plolcott/x86utm/blob/master/Halt7.c
When HHH computes the mapping from *its input* to
the behavior of DD emulated by HHH this includes
HHH emulating itself emulating DD. This matches
the infinite recursion behavior pattern.
Thus the Halting Problem's "impossible" input
is correctly determined to be non-halting.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer