XPost: comp.theory, comp.software-eng   
   From: polcott333@gmail.com   
      
   On 1/24/2026 6:52 PM, Richard Damon wrote:   
   > On 1/24/26 6:06 PM, olcott wrote:   
   >> On 1/6/2026 1:47 AM, dart200 wrote:   
   >   
   >>> the CT-thesis is a thesis, not a proof.   
   >> *I think that I fixed that*   
   >> It seems to me that if something cannot be computed   
   >> by applying finite string transformation rules to   
   >> input finite strings then it cannot be computed.   
   >>   
   >> As soon as this is shown to be categorically impossible   
   >> then the thesis turns into a proof.   
   >>   
   >   
   > In other words, you just don't know what you are talking about.   
   >   
      
   It is categorically impossible to define a   
   computation more powerful than that above.   
      
   > The fact that it is impossible to build a computation that, given a   
   > representation of another computation and its input, determine for all   
   > cases if the computation will halt does nothing to further the question   
   > of are Turing Machines the most powerful form of computation.   
      
      
   --   
   Copyright 2026 Olcott

   
      
   My 28 year goal has been to make 
   
   "true on the basis of meaning expressed in language"
   
   reliably computable for the entire body of knowledge.

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