[continued from previous message]   
      
   >> Example_is_Isomorphic_to_the_Liar_Paradox   
   >>   
   >   
   > i'm not really refuting the halting problem there, rather presenting a   
   > fundamental contradiction with rejecting the premise of a general   
   > halting deciders, namely that non-existent machines would exist   
   >   
   > it doesn't impact godel's claims because the argument is at the level of   
   > computing machines, not more fundamentals claims   
   >   
      
   As my signature line now stipulates   
   My 28 year goal has been to make   
   "true on the basis of meaning" computable.   
      
   This can be directly implemented to make   
   LLM systems much more reliable.   
      
   --   
   Copyright 2025 Olcott   
      
   My 28 year goal has been to make   
   "true on the basis of meaning" computable.   
      
   This required establishing a new foundation   
   for correct reasoning.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)