XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 11/17/2025 8:46 PM, dart200 wrote:   
   > On 11/17/25 4:31 PM, olcott wrote:   
   >> On 11/17/2025 6:06 PM, dart200 wrote:   
   >>> On 11/17/25 3:35 PM, olcott wrote:   
   >>>> The halting problem is requiring deciders to   
   >>>> compute information that is not contained in   
   >>>> their input.   
   >>>   
   >>> ur agreeing with turing and the halting problem:   
   >>>   
   >>> one cannot compute whether a machine halts or not from the string   
   >>> describing the machine   
   >>>   
   >>   
   >> That the halting problem limits computation   
   >> is like this very extreme example:   
   >>   
   >> Predict who the next president of the United States   
   >> will be entirely on the basis of √2 (square root of 2).   
   >> That cannot be derived from the input.   
   >   
   > bruh, ur agreeing with the halting problem:   
   >   
      
   No I am directly showing the key error of the   
   halting problem. It is very very difficult to   
   to understand. I have been working on this since   
   2004 and I just understood the error this year.   
      
   > one cannot take the string describing the machine, and use it to compute   
   > whether the machine described halts   
   >   
      
   The input to HHH(DD) specifies a different sequence   
   of steps than the input to HHH1(DD).   
      
   HHH simulates DD that calls HHH(DD)   
   that simulates DD that calls HHH(DD)...   
      
   HHH1 simulates DD that calls HHH(DD)   
   that returns to DD that returns to HHH1.   
      
   The sound basis of this reasoning is the   
   semantics of the C programming language.   
      
   typedef int (*ptr)();   
   int HHH(ptr P);   
   int HHH1(ptr P);   
      
   int DD()   
   {   
      int Halt_Status = HHH(DD);   
      if (Halt_Status)   
        HERE: goto HERE;   
      return Halt_Status;   
   }   
      
   int main()   
   {   
      HHH(DD);   
   }   
      
      
      
   > the only difference between ur claim here and the proofs is the why   
   >   
      
      
      
   --   
   Copyright 2025 Olcott   
      
   My 28 year goal has been to make   
   "true on the basis of meaning" computable.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)