Re: Two dozen people were simply wrong

On 5/29/2024 3:54 PM, Python wrote:

Le 29/05/2024 à 22:25, olcott a écrit :

On 5/29/2024 3:17 PM, Alan Mackenzie wrote:

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

When D is correctly simulated by H using an x86 emulator the only
way that the emulated D can reach its own emulated final state
at line 06 and halt is
(a) The x86 machine code of D is emulated incorrectly
(b) The x86 machine code of D is emulated in the wrong order

>
That reminds me of a sketch from Morecombe and Wise (for non-Brits: this
was a stand-up comdedy show from 1970s British television.  It was of
extraordinarily high quality).  It was where Eric Morecombe was
pretending to be a concert pianist playing Grieg's piano concerto under
conductor André Previn.  As his limited pianistic capabilities became
clear, on being accused of playing wrong notes, Eric replied, holding
André threateningly by the lapels "I'm playing the right notes - maybe
just not in the right order!".
>

>
*Yet still no actual review of what I actually said*

 Yet it is an accurate point about how your words are silly, pointless
and ridiculous. On psychological point of view the fact you don't
get that point is a clear sign of cognitive dissonance on your part.
 

typedef int (*ptr)();  // ptr is pointer to int function in C
00       int H(ptr p, ptr i);
01       int D(ptr p)
02       {
03         int Halt_Status = H(p, p);
04         if (Halt_Status)
05           HERE: goto HERE;
06         return Halt_Status;
07       }
08
09       int main()
10       {
11         H(D,D);
12         return 0;
13       }
The above template refers to an infinite set of H/D pairs where D is
correctly simulated by either pure simulator H or pure function H. This
was done because many reviewers used the shell game ploy to endlessly
switch which H/D pair was being referred to.
H correctly simulates 1 to ∞ steps of D with either pure function H or
pure simulator H. In none of these cases does the correctly simulated D
ever reach its own simulated final state and halt.
*In actual finite memory C the H/D pair would eventually crash*
*Correct Simulation Defined*
    This is provided because many reviewers had a different notion of
    correct simulation that diverges from this notion.
    A simulator is an x86 emulator that correctly emulates 1 to N of the
    x86 instructions of D in the order specified by the x86 instructions
    of D. This may include M recursive emulations of H emulating itself
    emulating D.
*Fully operational code proves recursive emulation*
When we see that D correctly simulated by pure simulator H would remain
stuck in infinite recursive simulation then we also know that less than
an infinite number of steps is not enough steps for D correctly
simulated by pure function H to reach its own simulated final state at
line 06 and halt.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer