XPost: comp.theory   
   From: dbush.mobile@gmail.com   
      
   On 10/28/2025 4:57 PM, olcott wrote:   
   > On 10/28/2025 2:37 PM, Kaz Kylheku wrote:   
   >> On 2025-10-28, olcott  wrote:   
   >>> On 10/28/2025 11:35 AM, Kaz Kylheku wrote:   
   >>>> On 2025-10-28, olcott  wrote:   
   >>>>> Deciders only compute a mapping from their actual   
   >>>>> inputs. Computing the mapping from non-inputs is   
   >>>>> outside of the scope of Turing machines.   
   >>>>   
   >>>> Calculating the halting of certain inputs is indeed impossible   
   >>>> for some halting algorithms.   
   >>>   
   >>> Not just impossible outside of the scope of every Turing machine.   
   >>> Its the same kind of thing as requiring the purely mental object   
   >>> of a Turing machine to bake a birthday cake.   
   >>   
   >> It simply isn't. Inputs that are not correctly solvable by some   
   >> deciders are decided by some others.   
   >>   
   >   
   > THIS INPUT IS SOLVABLE   
   > THE NON-INPUT IS OUT-OF-SCOPE   
      
   Then why do you claim that H(D) must decide on this non input?   
      
      
   int D()   
   {   
      int Halt_Status = UTM(D);   
      if (Halt_Status)   
        HERE: goto HERE;   
      return Halt_Status;   
   }   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)