Re: D correctly simulated by pure function H cannot possibly reach its, own line 06

On 5/25/24 7:11 PM, olcott wrote:

On 5/25/2024 5:59 PM, Richard Damon wrote:

On 5/25/24 6:53 PM, olcott wrote:

*We can get to that ONLY WHEN WE HAVE THE ABOVE SUBJECT AS A BASIS*
*We can get to that ONLY WHEN WE HAVE THE ABOVE SUBJECT AS A BASIS*
*We can get to that ONLY WHEN WE HAVE THE ABOVE SUBJECT AS A BASIS*

>
No we need to handle them to know what you have defined.
>
After all, if we don't agree on the inmplications, we don't have agreement on what is being stipuated as the defintions.
>

>
*Thus trolling me is made impotent*
*Thus trolling me is made impotent*
*Thus trolling me is made impotent*
>

>
They are not "Baseless" but based on the actual definitions of the terms that you are changing.
>

 *In other words you can show in a convincing way that this is false*
*In other words you can show in a convincing way that this is false*
*In other words you can show in a convincing way that this is false*

Didn't say that, which shows you to be a liar, or at least being deceptive, which is why we need to handle the implications first
(Note, you are just proving that you don't understand how logic works)
The implications of your specifications are:
1) That your H is NOT a computation equivalent for a Turing machine.
2) That you simulations do NOT say anything about the actual behavior of the machine given on the input, especially about its halting status.
3) That you "infinite set of H/D pairs" does NOT correspond to the concept of the behavior of a machine, and
4) That you D and H are NOT eqivalents of the corresponding things in the Linz or Sipser proofs.
5) You are not interested in Honest Dialog, but are hoping someone will agree to baddly defined terms so you can claim support for your lies.

 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 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.
 *Correct Simulation Defined*
    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.