XPost: comp.theory   
   From: chris.m.thomasson.1@gmail.com   
      
   On 10/27/2025 6:12 PM, olcott wrote:   
   > A straight forward sequence of steps that any   
   > C programmer can easily determine:   
      
   You moron! Where is H? Define it in std C. rofl. lol. sigh. What a joke.   
      
   >   
   > 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.   
   >   
   > *Once this is agreed to the C portion of my proof is complete*   
   >   
   > *Halting Problem Simulation in C*   
   > https://philpapers.org/archive/OLCHPS-2.pdf   
   >   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)