Five different LLM systems agree with my rebuttal of the HP proofs.
From olcott@polcott333@gmail.com to comp.theory,comp.lang.c,comp.lang.c++,comp.ai.philosophy on Tue Sep 2 13:18:51 2025
From Newsgroup: comp.lang.c++
Five different LLM systems figured out the recursive simulation
non-halting behavior pattern on their own without prompting.
They also correctly determined that the HP proof decider would
be correct to reject its input as non-halting.
<Input to LLM systems>
Simulating Termination Analyzer HHH correctly simulates its input until:
(a) Detects a non-terminating behavior pattern:
abort simulation and return 0.
(b) Simulated input reaches its simulated "return" statement:
return 1.
typedef int (*ptr)();
int HHH(ptr P);
int DD()
{
int Halt_Status = HHH(DD);
if (Halt_Status)
HERE: goto HERE;
return Halt_Status;
}
What value should HHH(DD) correctly return?
<Input to LLM systems>