XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   Turing machine deciders:   
   Transform finite strings by finite string   
   transformation rules into {Accept, Reject}.   
      
   Three page paper provides all the reasoning.   
   https://philpapers.org/archive/OLCDTF.pdf   
      
   --   
   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)