Re: Computable Functions --- finite string transformation rules --- 0 ≠1

On 4/26/2025 1:19 PM, Fred. Zwarts wrote:

Op 26.apr.2025 om 18:15 schreef olcott:>>

_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]
>
When any HHH emulates DD according to the finite
string transformation rules specified by the x86
language (the line of demarcation between correct
and incorrect emulation) no emulated DD can possibly
reach its final halt state and halt.
>

This behaviour of HHH blocks the analysis of the behaviour of DD.
This failure of HHH shows that it is not the right tool to analyse DD.
There are other tools that have no problem to reach the final end.

*You are clueless about this thus WILL NEVER GET IT*
"according to the finite string transformation rules
  specified by the x86 language."
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer