XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/25/2025 6:48 PM, olcott wrote:   
   > On 12/25/2025 5:39 PM, olcott wrote:   
   >>   
   >> https://chatgpt.com/share/694dcae3-a210-8011-b12f-a74007045a4a   
   >>   
   >   
   > "Any result that cannot be derived as a pure function   
   >   of finite strings is uncomputable."   
   >   
      
   If the halting problem itself required a halt   
   decider to report on the behavior that a finite   
   string INPUT specifies then it would not be   
   incorrect.   
      
   int P()   
   {   
      int Halt_Status = H(P);   
      if (Halt_Status)   
        HERE: goto HERE;   
      return Halt_Status;   
   }   
      
   H(P)==0 and H1(P)==1 both report on the behavior   
   that their finite string input specifies.   
      
   --   
   Copyright 2025 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning expressed in language"
   
   reliably computable.

   
      
   This required establishing a new foundation
   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)