On 2025-10-27 14:41:15 +0000, olcott said:I will simplify it for you:
On 10/27/2025 4:51 AM, Mikko wrote:Note that the above keeps the option to deceive with equivocation.On 2025-10-26 11:28:47 +0000, Tristan Wibberley said:>
>On 26/10/2025 09:11, Mikko Levanto wrote:>
>HHH never dimulates more steps than there are in DD, and there id only a>
finite number of steps there.
Are we taking that "DD" refers to a C-function that is fully defined
because HHH has external linkage and is thus not part of the referent or
partially defined because HHH, as a callee from the referent, is part of
the referent itself?
I am. Olcott does not specify as that would prevent the equivocation
deception that might be useful later, dependig on how others respond.
Now that four different LLM systems have been able
reverse-engineer the non-halting result by merely
being told to faithfully simulate DD with HHH and
see what happens this proves that all of my reviewers
have been dishonest with me for three years.
>
typedef int (*ptr)();
int HHH(ptr P);
>
>
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
>
int main()
{
HHH(DD);
}
>
*Halting Problem Simulation in C*
https://philpapers.org/archive/OLCHPS-2.pdf
Anyone knowing C and denying this is a liar.
int D()
{
int Halt_Status = H(D);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
H simulates D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
that calls H(D) to simulate D
until H sees this repeating pattern.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer
Les messages affichés proviennent d'usenet.