XPost: comp.theory, sci.logic   
   From: polcott333@gmail.com   
      
   On 12/10/2025 3:43 AM, Mikko wrote:   
   > polcott kirjoitti 10.12.2025 klo 0.27:   
   >> These are finally the long sought words that do   
   >> resolve the halting problem to a category error.   
   >   
   >> Turing machine deciders only compute the 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 particular semantic   
   >> or syntactic property.   
   >   
   > The above paragraph (acutally just one sentence) does not prove or   
   > even say anything about the halting problem.   
   >   
      
   It is the definition of a decider that the halting   
   problem violates.   
      
   --   
   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)