Re: At least 100 people kept denying the easily verified fact --- last communication with Richard

On 6/8/24 9:06 AM, olcott wrote:

On 6/8/2024 1:58 AM, Mikko wrote:

On 2024-06-07 18:41:47 +0000, olcott said:
>

On 6/7/2024 1:24 PM, Richard Damon wrote:

On 6/7/24 2:02 PM, olcott wrote:

On 6/7/2024 12:50 PM, Alan Mackenzie wrote:

[ Followup-To: set ]
>
In comp.theory olcott <polcott333@gmail.com> wrote:
>
[ .... ]
>

_DD()
[00001e12] 55         push ebp
[00001e13] 8bec       mov  ebp,esp
[00001e15] 51         push ecx
[00001e16] 8b4508     mov  eax,[ebp+08]
[00001e19] 50         push eax      ; push DD
[00001e1a] 8b4d08     mov  ecx,[ebp+08]
[00001e1d] 51         push ecx      ; push DD
[00001e1e] e85ff5ffff call 00001382 ; call HH

>

A {correct simulation} means that each instruction of the
above x86 machine language of DD is correctly simulated
by HH and simulated in the correct order.

>
That's a bit of sudden and substantial change, isn't it?  Less than a few
days ago, you were defining a correct simulation as "1 to N instructions"
simulated (without ever specifying what you meant by N).  It seems that
the simulation of exactly one instruction would have met your criterion.
>
That now seems to have changed.
>

>
Because I am a relatively terrible writer I must constantly
improve my words on the basis of reviews.
>
Try to show how this DD correctly simulated by any HH ever
stops running without having its simulation aborted by HH.
>
_DD()
[00001e12] 55         push ebp
[00001e13] 8bec       mov  ebp,esp
[00001e15] 51         push ecx
[00001e16] 8b4508     mov  eax,[ebp+08]
[00001e19] 50         push eax      ; push DD
[00001e1a] 8b4d08     mov  ecx,[ebp+08]
[00001e1d] 51         push ecx      ; push DD
[00001e1e] e85ff5ffff call 00001382 ; call HH
>
A {correct simulation} means that each instruction of the
above x86 machine language of DD is correctly simulated
by HH and simulated in the correct order.
>
Anyone claiming that HH should report on the behavior
of the directly executed DD(DD) is requiring a violation
of the above definition of correct simulation.
>

>
And thus you admit that HH is not a Halt Decider,

>
More dishonest deflection.
The point that I made and you try to deflect using the strawman
deception as a fake rebuttal is the I just proved that DD is correctly
simulated by HH and this is not the same behavior as the directly
executed DD(DD).

>
The true point is that you have never shown any proof about simulation
by HH.
>

 In other words you lack the mandatory prerequisites so the
correct proof only looks like gibberish to you.
 I incorporate by reference
(a) The x86 language
(b) The notion of an x86 emulator
 (c) I provide this complete function
 void DDD(int (*x)())
{
   HH(x, x);
}
 _DDD()
[00001de2] 55         push ebp
[00001de3] 8bec       mov ebp,esp
[00001de5] 8b4508     mov eax,[ebp+08]
[00001de8] 50         push eax         ; push DD
[00001de9] 8b4d08     mov ecx,[ebp+08]
[00001dec] 51         push ecx         ; push DD
[00001ded] e890f5ffff call 00001382    ; call HH
[00001df2] 83c408     add esp,+08
[00001df5] 5d         pop ebp
[00001df6] c3         ret
Size in bytes:(0021) [00001df6]
 Then I state that No DDD correctly emulated by any
x86 emulator H can possibly reach its own [00001df6]
instruction.

Which shows that YOU lack the neccessary mandaroty prerequesits to talk about logic, since that is NOT a proof statement, but a conclusion that hasn't been actually proven.

 To anyone having this mandatory prerequisite knowledge
(perhaps not you) every x86 emulation of DDD by any
x86 emulator H continually repeats the first seven lines
of DDD until it crashes due to out-of-memory error.
 

Which means you are stipulating that ALL your "deciders" will fail to decide, and thus your system is just incorrect.
That our you are just admitting to LYING about P / D / DD / DDD being built by the templates of the Linz / Sipser proofs on the actual decider that is claimed to be correct, but are just straw men to try to justify your false claims.
Take you pick, which wrong version are you in?