XPost: comp.theory, sci.math, comp.lang.prolog   
   XPost: comp.software-eng   
   From: polcott333@gmail.com   
      
   All deciders essentially: Transform finite string   
   inputs by finite string transformation rules into   
   {Accept, Reject} values.   
      
   The counter-example input to requires more than   
   can be derived from finite string transformation   
   rules applied to this specific input thus the   
   Halting Problem requires too much.   
      
      
   --   
   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-DOS v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)