XPost: comp.theory, sci.logic, sci.math   
   From: dbush.mobile@gmail.com   
      
   On 10/23/2025 10:43 AM, olcott wrote:   
   > As I have recently shown the halting problem requires   
   > a halt decider to do what no Turing machine can do   
   > to compute the mapping other than the one specified   
   > by its input. This is a category error.   
      
   False, as you have admitted:   
      
      
   On 10/20/2025 11:51 PM, olcott wrote:   
    > On 10/20/2025 10:45 PM, dbush wrote:   
    >> And it is a semantic tautology that a finite string description of a   
    >> Turing machine is stipulated to specify all semantic properties of the   
    >> described machine, including whether it halts when executed directly.   
    >> And it is this semantic property that halt deciders are required to   
    >> report on.   
    >   
    > Yes that is all correct   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)