[continued from previous message]   
      
   >      its simulated final halt state of ⟨Ĥ.qn⟩, and   
   >   
   > Ĥ.q0 ⟨Ĥ⟩ ⊢* Ĥ.embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn   
   >      ⟨Ĥ⟩ ⟨Ĥ⟩ simulated by Ĥ.embedded_H cannot possibly   
   >      reach its simulated final halt state of ⟨Ĥ.qn⟩.   
   >   
   > When Ĥ is applied to ⟨Ĥ⟩ and embedded_H is a   
   > simulating partial halt decider   
   > (a) Ĥ copies its input ⟨Ĥ⟩   
   > (b) Ĥ invokes embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩   
   > (c) embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩   
   > (d) simulated ⟨Ĥ⟩ copies its input ⟨Ĥ⟩   
   > (e) simulated ⟨Ĥ⟩ invokes simulated embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩   
   > (f) simulated embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩   
   > (g) goto (d) with one more level of simulation until   
   > *embedded_H sees the repeating pattern and transitions to Ĥ.qn*   
      
   But when this is only finite repeating pattern, it is incorrect to   
   report non-termination.   
   Ignoring the conditional branch instructions in the embedded_H, will   
   cause that it is unable to decide between a finite and an infinite   
   repeating pattern, between halting and non-halting behaviour.   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)