XPost: comp.theory   
   From: dbush.mobile@gmail.com   
      
   On 10/28/2025 12:49 PM, olcott wrote:   
   > On 10/28/2025 11:33 AM, Kaz Kylheku wrote:   
   >> On 2025-10-28, olcott  wrote:   
   >>> When simulating halt decider H is reporting on the   
   >>> behavior that its input specifies then H is correct   
   >>> to reject D as non-halting.   
      
   The above point   
      
   >>   
   >> If H rejects D as non-halting, it makes D halting.   
   >>   
   >> I have demonstrated that with actual code.   
   >>   
      
   Is refuted above   
      
   >   
   > 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.   
      
   And repeated above.   
      
   Repeating a previously refuted point is less that no rebuttal and is   
   your admission that the refutation, i.e. that Kaz's code proves that D   
   is halting, is *CORRECT*.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)