On 8/10/25 12:25 AM, olcott wrote:
On 8/9/2025 8:10 PM, Mr Flibble wrote:
On Sat, 09 Aug 2025 19:58:18 -0500, olcott wrote:
On 8/9/2025 7:20 PM, Mr Flibble wrote:
Without realising it Olcott has actually confirmed rather than refuted >>>> the Halting Problem:
In x86utm, H simulates D(D), detects the nested recursion as
non-halting, aborts, and returns 0 (non-halting). But when D(D) runs
for real:
* It calls H(D,D).
* H simulates, aborts the simulation (not the real execution), and
returns 0 (non-halting).
* D, receiving 0 (non-halting), halts.
Thus, the actual machine D(D) halts, but H reported "does not halt". H >>>> is wrong about the machine's behavior which aligns with the
diagonalization paradox at the heart of extant Halting Problem proofs. >>>>
/Flibble
*This does not quite say it that way*
https://claude.ai/share/da9e56ba-f4e9-45ee-9f2c-dc5ffe10f00c *It does
say that HHH(DD)==0 is correct*
Without realising it Olcott has actually confirmed rather than refuted
the
Halting Problem PROOFS:
The above simple one page Claude AI review at the notion
of simulating Termination analyzer HHH being applied
to input DD.
Based on your misleading prompt.
You forgot to include that HHH might loop forever and not return an
answer if there is no finite non-repeating behavior pattern to find.
But then, YOU have that same misconception, even when this is proven to you.
Note, at the end it tells you that the direct execution halts because of
this, as apparently you have taught it that these don't need to match,
even though the problem statement is about the direct exectution of the
program the input represents.
The falsehood that returning 0 is correct, comes from the implied
requirement that HHH *MUST* return something, even if it has not
actually proved that result.
In x86utm, H simulates D(D), detects the nested recursion as non-halting,
aborts, and returns 0 (non-halting). But when D(D) runs for real:
* It calls H(D,D).
* H simulates, aborts the simulation (not the real execution), and
returns
0 (non-halting).
* D, receiving 0 (non-halting), halts.
Thus, the actual machine D(D) halts, but H reported "does not halt". H is
wrong about the machine's behavior which aligns with the diagonalization
paradox at the heart of extant Halting Problem proofs.
/Flibble
--- SoupGate-Win32 v1.05
* Origin: fsxNet Usenet Gateway (21:1/5)