XPost: comp.theory, sci.logic, sci.math   
   From: polcott333@gmail.com   
      
   On 12/20/2025 4:07 AM, Mikko wrote:   
   > On 20/12/2025 03:27, olcott wrote:   
   >> Deciders: Transform finite strings by finite   
   >> string transformation rules into {Accept, Reject}   
   >>   
   >> https://philpapers.org/archive/OLCDTF.pdf   
   >   
   > As there are no halt deciders they don't work at all.   
   >   
      
   There is a halt decider for the HP counter-example   
   input. The definition of halt decider required by the   
   halting problem contradicts the definition of computation.   
   You can see that I am correct when you pay attention.   
   to pages 7-9.   
      
   --   
   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)