XPost: comp.theory, comp.ai.philosophy, sci.math   
   From: polcott333@gmail.com   
      
   On 12/11/2025 7:29 PM, Richard Damon wrote:   
   > On 12/11/25 8:06 PM, olcott wrote:   
   >> *Very simple first principles showing the halting problem error*   
   >   
   > And if you want to do this, then you need to start by stating the   
   > principles you are using, and then the logical steps that get you to   
   > what you are claiming.   
   >   
      
   Turing machine deciders compute functions from finite   
   strings to {accept, reject}.   
      
   The halting problem itself requires that deciders   
   compute the behavior of executing machines, thus   
   category error flat out and simple.   
      
      
   --   
   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)