XPost: comp.theory   
   From: polcott333@gmail.com   
      
   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   
      
   DO I HAVE TO REPEAT THAT 10,000   
   TIME BEFORE YOU NOTICE THAT I EVER SAID IT ONCE?   
      
   int D()   
   {   
      int Halt_Status = H(D);   
      if (Halt_Status)   
        HERE: goto HERE;   
      return Halt_Status;   
   }   
      
   H simulates D   
   that calls H(D) to simulate D   
   that calls H(D) to simulate D   
   that calls H(D) to simulate D   
   that calls H(D) to simulate D   
   that calls H(D) to simulate D   
   until H sees this repeating pattern.   
      
   When simulating halt decider H is reporting on the   
   behavior that its input specifies then H is correct   
   to reject D as non-halting.   
      
   Deciders only compute a mapping from their actual   
   inputs. Computing the mapping from non-inputs is   
   outside of the scope of Turing machines.   
      
   --   
   Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius   
   hits a target no one else can see." Arthur Schopenhauer   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)