XPost: comp.theory, comp.ai.philosophy, comp.software-eng   
   From: flibble@reddwarf.jmc   
      
   On Fri, 21 May 2021 11:33:25 -0500   
   olcott  wrote:   
      
   > (A) Every simulation of input P that never halts unless simulating   
   > halt decider H aborts this simulation  a non-halting computation.   
   > This remains true even after H stops simulating P.   
      
   If the simulator aborts the simulation then the simulation didn't halt,   
   the simulator halted the simulation.  You cannot assume P is   
   non-halting simply because your omnishambles cockwomble of a   
   "partial halt decider" aborted the simulation until you address the   
   issues of branching logic predicated on arbitrary program input.   
      
   >    
   > ∃H ∈ Simulating_Halt_Deciders   
   > ∀P ∈ Turing_Machine_Descriptions   
   > ∀I ∈ Finite_Strings   
   >    (UTM(P,I) = ∞) ⊢ (H(P,I) = 0)   
      
   Please refrain from using mathematical symbols that aren't present in   
   most fonts; Usenet readers often don't support displaying them as they   
   don't support fallback fonts.   
      
   [snip]   
      
   /Flibble   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)