Re: ChatGPT and claude.ai agree that I have refuted the conventional Halting Problem proof technique ---

On 7/1/2025 3:56 AM, joes wrote:

Am Mon, 30 Jun 2025 16:50:11 -0500 schrieb olcott:

On 6/30/2025 3:40 PM, joes wrote:

Am Mon, 30 Jun 2025 11:33:40 -0500 schrieb olcott:

 

The conditional branch instructions in HHH cannot possibly have any
effect whatsoever on whether or not the simulated DDD reaches its own
"return" instruction final halt state.

But of course they do. Once as part of the outermost simulator, deter-
mining whether to abort, and once as part of DDD, determining whether
to return.

 

HHH simply simulates DDD with a pure simulator until it conclusively
proves that its outermost simulated DDD cannot possibly reach its own
simulated "return" statement final halt state. When it aborts this DDD
all recursive emulations immediately stop.

Right, HHH is not a pure simulator.
The simulations would have halted if *only* the outermost HHH was pure
and did not abort.

Since you know that is impossible because every instance of HHH has the
exact same machine code at the same machine address why bring it up?

Read below.

*There is not good reason to begin reasoning with a lie*

 

  *That* is what
what Sipser's twisted-by-you words meant, not simulating a different
DDD that calls a pure simulator. The code of DDD, including HHH, is
fixed and "describes" a partial simulator; you can't in a program
magically refer to "itself", you have to arrange for the explicit
mention to fall together with its name (except in Lisp maybe).

<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
     If simulating halt decider H correctly simulates its
     input D until H correctly determines that its simulated D
     would never stop running unless aborted then
     H can abort its simulation of D and correctly report that D
     specifies a non-halting sequence of configurations.
</MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
DDD correctly simulated by HHH
(a) Will never stop running unless aborted
(b) Never reach its own simulated return" statement final halt state
*That is a verified fact thus disagreement is an error*
typedef void (*ptr)();
int HHH(ptr P);
void DDD()
{
   HHH(DDD);
   return;
}
int main()
{
   HHH(DDD);
}
Termination Analyzer HHH simulates its input until
it detects a non-terminating behavior pattern. When
HHH detects such a pattern it aborts its simulation
and returns 0.
Four different chatbots all agree that DDD correctly
simulated by HHH specifies the non terminating behavior
pattern of recursive simulation.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer