XPost: comp.theory   
   From: dbush.mobile@gmail.com   
      
   On 8/20/2025 11:10 PM, olcott wrote:   
   > Simulating (at least partial) halt decider Ĥ.embedded_H   
      
   False.  The proof starts with the assumption that H is a total halt decider:   
      
    > We assume the contrary, namely that there exists an algorithm,   
    > and consequently some Turing machine H, that solves the halting problem   
      
    From there, through a series of truth-preserving operations, it is   
   concluded that it is possible to construct Ĥ from total halt decider H   
   to form a contradiction.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)