XPost: comp.theory, comp.ai.philosophy   
   From: polcott333@gmail.com   
      
   On 12/9/2025 4:27 PM, 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.   
   >   
      
   int DD()   
   {   
      int Halt_Status = HHH(DD);   
      if (Halt_Status)   
        HERE: goto HERE;   
      return Halt_Status;   
   }   
      
   int main()   
   {   
      HHH(DD);   
   }   
      
   Once we have a way to detect the sequence of   
   steps that the input to HHH(DD) specifies:   
      
   DD simulated by HHH (according to the   
   semantics of the C programming language)   
      
   and this differs from what the halting problem   
   requires, then we know that the halting problem   
   is wrong by the above paragraph.   
      
      
      
   until HHH sees that   
   the behavior of DD correctly matches a correct   
   non-halting behavior pattern. Then HHH aborts it   
   simulation and returns 0 indicating rejection of   
   its input.   
      
      
   --   
   Copyright 2025 Olcott   
      
   My 28 year goal has been to make   
   "true on the basis of meaning" computable.   
      
   This required establishing a new foundation   
   for correct reasoning.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)