XPost: comp.theory, sci.logic   
   From: polcott333@gmail.com   
      
   On 12/11/2025 7:42 PM, HAL 9000 wrote:   
   > On Tue, 09 Dec 2025 16:27:53 -0600, polcott wrote:   
   >   
   >> 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   
   >   
   > Flibble was the first to claim the Halting Problem was a category error in   
   > this very forum.   
   >   
      
   Flibble's original view of category is easy to prove.   
      
   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.   
      
   > Flibble has retracted that claim as he now believes that diagonalisation   
   > (proof by contradiction) is a valid, logically sound technique.   
   >   
   > /HAL   
      
   When we look at it that way this only proves   
   that incorrect questions lack correct answers.   
      
      
   --   
   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)