XPost: comp.theory   
   From: chris.m.thomasson.1@gmail.com   
      
   On 10/28/2025 2:40 PM, olcott wrote:   
   > On 10/28/2025 4:33 PM, Kaz Kylheku wrote:   
   >> On 2025-10-28, olcott wrote:   
   >>> On 10/28/2025 3:37 PM, Kaz Kylheku wrote:   
   >>>> The above C violates a rule.   
   >>>   
   >>> I am providing the gist of the essence because   
   >>   
   >> C does not run on gists and essences, sorry.   
   >>   
   >   
   > In other words you are trying to get away with   
   > pretending that you are too damned stupid to   
   > do this execution trace in your head?   
   >   
   > int D()   
   > {   
   > int Halt_Status = H(D);   
   > if (Halt_Status)   
   > HERE: goto HERE;   
   > return Halt_Status;   
   > }   
   >   
   > H simulates D   
   > that calls H(D) to simulate D   
   > that calls H(D) to simulate D   
   > that calls H(D) to simulate D   
   > that calls H(D) to simulate D   
   > that calls H(D) to simulate D   
   > until H sees this repeating pattern.   
   >   
      
   HHH(DD)? Or, H(D), or HHHHH(D), ect? Anyway:   
      
      
   int D() {   
    for (;;)   
    {   
    if (! H(D, D)) break;   
    // we are in a loop.   
    }   
      
    return HALT;   
   }   
      
   Or   
      
   int D() {   
    if (H(D, D))   
    {   
    // Bump the per path counter for non-halt   
      
    for (;;)   
    {   
    // we are in a loop.   
    ct_sim_yield_fiber(...);   
    }   
      
    return NON_HALT;   
    }   
      
    // Bump the per path counter for halt   
      
    return HALT;   
   }   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)   
|