Re: Two dozen people were simply wrong --- Try to prove otherwise --- pinned down

On 5/31/24 7:57 PM, olcott wrote:

On 5/31/2024 6:33 PM, Richard Damon wrote:

On 5/31/24 6:54 PM, olcott wrote:

On 5/31/2024 5:46 PM, Richard Damon wrote:

On 5/31/24 6:08 PM, olcott wrote:

On 5/31/2024 4:36 PM, Richard Damon wrote:

On 5/31/24 10:10 AM, olcott wrote:

On 5/31/2024 6:16 AM, Richard Damon wrote:

On 5/30/24 11:27 PM, olcott wrote:

Try and show how HH using an x86 emulator can correctly emulate
the following x86 machine code such that DD reaches its own
machine address 00001c47.

>
Why should I, since that isn't what I was saying.
>

>
*To me that looks like you know that*
*you have been busted in a lie and are backing down*

>
no, YOU are LYING RIGHT HERE AND NOW.
>
Prove that I said that the simulation by HH made it there, or admit to being a DAMNED LIAR.
>
What I have been saying is the the DIRECT EXDCUTION of DD, and the CORRECT (and complete) simulation of the input to HH by an actual UTM will get there.
>

>
That has always been the dishonest dodge strawman deception
CHANGE-THE-SUBJECT fake rebuttal regarding
the behavior of DD correctly simulated by pure function HH.

>
But it is your talking about the "correctly simulated by HH" that is the dishonest dodge,

>
Try and show how HH using an x86 emulator can correctly emulate
the following x86 machine code such that DD reaches its own
machine address 00001c47.

>
Never said it could. But haven't looked hard enough to be willing to say it can't, but then, who cares, it doesn't say a thing about the real halting problem, since H's simulation isn't "correct" by a definition that relates simulation to non-halting behavior,
>

 "...the Turing machine will halt whenever it enters a final state."
Linz(1990:234)

Right, and that is talking about runnig the Turing Machine, not simulating a representation of it.

 *If DD correctly simulated by HH can't possibly reach its own*
*final state then DD correctly simulated by HH is non-halting*

Nope, Where did that definition say ANYTHING about one machine simulationg another.
I think the problem is you just don't know what a Turing Machien actually is.
You have been wasting the last 2 decades of your life, because you have been lying to yourself that you understood something that you actually have no idea what it is.
I still remember a couple of years ago when you tried to learn what a Turing machine was, but just totall failed.

 *When we get as specific as the actual x86 machine code of*
*DD then all liars are exposed*
 

Which has nothing to do with Turing Machines.
The closest equivalent would bd RUNNING the function DD(DD), which you have agreed will Halt as long as HH is actually the decider you claim.

typedef int (*ptr)();  // ptr is pointer to int function in C
00       int HH(ptr p, ptr i);
01       int DD(ptr p)
02       {
03         int Halt_Status = HH(p, p);
04         if (Halt_Status)
05           HERE: goto HERE;
06         return Halt_Status;
07       }
08
09       int main()
10       {
11         HH(DD,DD);
12         return 0;
13       }
 _DD()
[00001c22] 55         push ebp
[00001c23] 8bec       mov ebp,esp
[00001c25] 51         push ecx
[00001c26] 8b4508     mov eax,[ebp+08]
[00001c29] 50         push eax        ; push DD 1c22
[00001c2a] 8b4d08     mov ecx,[ebp+08]
[00001c2d] 51         push ecx        ; push DD 1c22
[00001c2e] e80ff7ffff call 00001342   ; call HH
[00001c33] 83c408     add esp,+08
[00001c36] 8945fc     mov [ebp-04],eax
[00001c39] 837dfc00   cmp dword [ebp-04],+00
[00001c3d] 7402       jz 00001c41
[00001c3f] ebfe       jmp 00001c3f
[00001c41] 8b45fc     mov eax,[ebp-04]
[00001c44] 8be5       mov esp,ebp
[00001c46] 5d         pop ebp
[00001c47] c3         ret
Size in bytes:(0038) [00001c47]