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

On 6/1/2024 3:26 PM, joes wrote:

Am Sat, 01 Jun 2024 11:13:10 -0500 schrieb olcott:

On 6/1/2024 10:56 AM, Richard Damon wrote:

On 6/1/24 11:30 AM, olcott wrote:

>
*I will not discuss any other points with you until after you either*
(a) Acknowledge that DD correctly simulated by HH and ⟨Ĥ⟩ ⟨Ĥ⟩
correctly
      simulated by embedded_H remain stuck in recursive simulation
      for 1 to ∞ of correct simulation or
>
(b) Correctly prove otherwise.

>
And until you answer the question of what that actually means, I will
reply WHO CARES.
>
>

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       }
>
Every DD correctly simulated by any HH of the infinite set of HH/DD
pairs that match the above template never reaches past its own simulated
line 03 in 1 to ∞ steps of correct simulation of DD by HH.
>
In this case HH is either a pure simulator that never halts or HH is a
pure function that stops simulating after some finite number of
simulated lines. The line count is stored in a local variable.
The pure function HH always returns the meaningless value of 56 after it
stops simulating.

Didn't you forbid additional parameters?
56 evaluates as True, so D never returns.
 

Disingenuous reply ignored.
Pages 4-5 of
*The 2021-09-26 version of my first paper on simulating halt deciders*
*Halting problem undecidability and infinitely nested simulation*
https://www.researchgate.net/publication/351947980_Halting_problem_undecidability_and_infinitely_nested_simulation --
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer