XPost: comp.theory   
   From: noreply@example.org   
      
   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? 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.   
      
   --   
   Am Sat, 20 Jul 2024 12:35:31 +0000 schrieb WM in sci.math:   
   It is not guaranteed that n+1 exists for every n.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)