Re: The HP does not exist as stated .. [ Simulating halt deciders ]

Skip to first unread message


Jul 31, 2021, 5:15:49 PMJul 31
On 7/31/2021 3:59 PM, Mr Flibble wrote:
> .. because it is predicated on an erroneous contradiction!
> It is really that simple!
> This is a troll.
> /Flibble

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

// Simplified Linz Ĥ (Linz:1990:319)
// Strachey(1965) CPL translated to C
void P(u32 x)
if (H(x, x))
HERE: goto HERE;

int main()
Output("Input_Halts = ", H((u32)P, (u32)P));

A simulating halt decider H correctly decides that its input (P,P) never
reaches it final state.

This same statement equally applies to the Peter Linz proof when Ĥ is
applied to its own Turing Machine description ⟨Ĥ⟩ as shown in my paper.

Copyright 2021 Pete Olcott

"Great spirits have always encountered violent opposition from mediocre
minds." Einstein
Reply all
Reply to author
0 new messages