H(D,D)==0 is proven to be correct

[olcott]

int D(int (*x)())
{
int Halt_Status = H(x, x);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}

int main()
{
Output("Input_Halts = ", H(D,D));
Output("Input_Halts = ", D(D));
}

H(D,D) does correctly compute the mapping from its input to its reject
state on the basis that H correctly predicts that D correctly simulated
by H would never halt.

--
Copyright 2023 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

[Richard Damon]

On 2/16/23 9:43 AM, olcott wrote:
> int D(int (*x)())
> {
>   int Halt_Status = H(x, x);
>   if (Halt_Status)
>     HERE: goto HERE;
>   return Halt_Status;
> }
>
> int main()
> {
>   Output("Input_Halts = ", H(D,D));
>   Output("Input_Halts = ", D(D));
> }
>
> H(D,D) does correctly compute the mapping from its input to its reject
> state on the basis that H correctly predicts that D correctly simulated
> by H would never halt.
>

In computability theory, the halting problem is the problem of
determining, from a description of an arbitrary computer program and an
input, whether the program will finish running, or continue to run forever.

D(D) Halts

H(D,D) says Non-Halting and is claimed correct

Therefore H is NOT a Halting Decider, but just a POOP decider (what your
actual criteria is talking about).