Concise refutation of halting problem proofs V35

[olcott]

When-so-ever simulating halt decider H(X,Y) determines that the
simulated behavior of its input correctly matches a infinite behavior
pattern such that the input would never stop running unless its
simulation is aborted H correctly aborts this input and returns 0.

// Simplified Linz(1990) Ĥ and Strachey(1965) P
void P(u32 x)
{
if (H(x, x))
HERE: goto HERE;
}

This correctly eliminates the pathological feedback loop between the
halt decider and its input that otherwise make input like the above
input impossible for H(P,P) to decide.

Halting problem undecidability and infinitely nested simulation V2

https://www.researchgate.net/publication/356105750_Halting_problem_undecidability_and_infinitely_nested_simulation_V2




--
Copyright 2021 Pete Olcott

Talent hits a target no one else can hit;
Genius hits a target no one else can see.
Arthur Schopenhauer