XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   It is self-evident that a subset of Turing machines   
   can be Turing complete entirely on the basis of the   
   meaning of the words.   
      
   Every machine that performs the same set of   
   finite string transformations on the same inputs   
   and produces the same finite string outputs from   
   these inputs is equivalent by definition and thus   
   redundant in the set of Turing complete computations.   
      
   Can we change the subject now?   
      
   --   
   Copyright 2026 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)