XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   Deciders: Transform finite string inputs by finite string   
   transformation rules into {Accept, Reject} values.   
      
   When there are no finite string transformation rules that   
   transform the input finite string into {Accept, Reject} values   
   the conventional view is that the input is undecidable.   
      
   --   
   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)