XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   Turing machine deciders only compute a mapping from   
   their [finite string] inputs to an accept or reject   
   state on the basis that this [finite string] input   
   specifies or fails to specify a semantic or syntactic   
   property.   
      
   Within the verified truth of the above paragraph   
   *that took me three years to write* the halting   
   problem is proved to be incorrect in that it requires   
   that halting be computed from behavior other than   
   the actual behavior that the actual input actually   
   specifies as measured by a UTM based halt decider.   
      
   --   
   Copyright 2025 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning" computable.

   
      
   This required establishing a new foundation
   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)