XPost: comp.theory, sci.math, comp.ai.philosophy   
   From: mikko.levanto@iki.fi   
      
   On 20/12/2025 13:44, olcott wrote:   
   > On 12/20/2025 4:07 AM, Mikko wrote:   
   >> On 20/12/2025 03:27, olcott wrote:   
   >>> Deciders: Transform finite strings by finite   
   >>> string transformation rules into {Accept, Reject}   
   >>>   
   >>> https://philpapers.org/archive/OLCDTF.pdf   
   >>   
   >> As there are no halt deciders they don't work at all.   
   >>   
   >   
   > Pages 7-8 prove that the halting problem   
   > itself is incorrect.   
      
   There is an error in the first sentence under the headline "1. What   
   the Halting Problem (HP) Requires": the first clause of the first   
   sentence is "Formally, the halting problem assumes the existence of   
   a decider" which is false. The halting problem does not assume the   
   existence of any decider. Consequently nothing that follows is valid   
   as a proof.   
      
   What can be proven is that there are no halting deciders. THerefore   
   there is no halting decder that works.   
      
   --   
   Mikko   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)