XPost: comp.theory   
   From: polcott333@gmail.com   
      
   On 10/28/2025 4:09 PM, joes wrote:   
   > Am Tue, 28 Oct 2025 15:57:29 -0500 schrieb olcott:   
   >> On 10/28/2025 2:37 PM, Kaz Kylheku wrote:   
   >>> On 2025-10-28, olcott  wrote:   
   >   
   >>>> 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   
      
   > What non-input?   
      
   The input to H(D) is its argument.   
   The non-input to H is the D() executed from main().   
      
   Apparently this single little detail overturns   
   a foundational element of computer science.   
      
   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.   
      
   > H gets passed (a pointer to) the code of D including   
   > the version of H that aborts. If you pass that to a UTM or H1, it halts.   
   >   
      
      
   --   
   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)