Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable

On 5/7/2025 4:47 PM, dbush wrote:

On 5/7/2025 5:46 PM, olcott wrote:

On 5/7/2025 4:30 PM, Richard Heathfield wrote:

On 07/05/2025 20:35, olcott wrote:

On 5/7/2025 1:59 PM, Richard Heathfield wrote:

On 07/05/2025 19:31, olcott wrote:

>
<snip>
>

>
I already know that the contradictory part of the
counter-example input has always been unreachable code.

>
If the code is unreachable, it can't be part of a working program, so simply remove it.

>
It is unreachable by the Halting Problem counter-example
input D when correctly simulated by the simulating
termination analyzer H that it has been defined to thwart.

>
If the simulation can't reach code that the directly executed program reaches, then it's not a faithful simulation.
>

>
If is was true that it is not a faithful simulation
then you would be able to show exactly what sequence
of instructions would be a faithful simulation.

  The sequence executed by HHH1, as you are on record as admitting is correct:
 

What exact sequence of the following machine addresses
of DD emulated by HHH causes DD to reach its own
final halt state at machine address [00002155]
When this sequence is required to conform to the
rules of the x86 language?
_DD()
[00002133] 55         push ebp      ; housekeeping
[00002134] 8bec       mov ebp,esp   ; housekeeping
[00002136] 51         push ecx      ; make space for local
[00002137] 6833210000 push 00002133 ; push DD
[0000213c] e882f4ffff call 000015c3 ; call HHH(DD)
[00002141] 83c404     add esp,+04
[00002144] 8945fc     mov [ebp-04],eax
[00002147] 837dfc00   cmp dword [ebp-04],+00
[0000214b] 7402       jz 0000214f
[0000214d] ebfe       jmp 0000214d
[0000214f] 8b45fc     mov eax,[ebp-04]
[00002152] 8be5       mov esp,ebp
[00002154] 5d         pop ebp
[00002155] c3         ret
Size in bytes:(0035) [00002155]
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer