Re: Functions computed by Turing Machines MUST apply finite string transformations to inputs +++

On 5/4/2025 11:21 AM, Richard Heathfield wrote:

On 04/05/2025 17:06, olcott wrote:
 <snip>
 

They simply guess that because DD(DD) halts that
DD correctly simulated by HHH must also halt.

 It's not a guess. If direct execution halts, so must the simulation.

_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]
Maybe you are confused between halting (reaching
a final halt state and terminating normally)
with stopping running for any reason such as
an aborted emulation. *THEY ARE NOT THE SAME*
DD correctly emulated by HHH stops running when
HHH aborts its simulation.
DD correctly emulated by HHH cannot possibly
reach its "return" instruction final halt state.
You must be imagining that DD emulated by HHH
leaps over the "call" instruction and jumps
straight to the "ret" instruction.
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer