XPost: comp.theory, comp.ai.philosophy, comp.software-eng   
   From: flibble@reddwarf.jmc   
      
   On Thu, 20 May 2021 12:11:14 -0500   
   olcott  wrote:   
      
   > This is a {clarification, correction and simplification} of the Peter    
   > Linz text:   
   [snip]   
   >    
   > Conclusion:   
   > Ĥ is a halting computation and its input is not a halting computation    
   > therefore Ĥ decides its input [Ĥ] as non-halting correctly.   
      
   Conclusion:   
   Truisms by definition are self evidently true so if you are having to    
   explain truisms then Occam's Razor suggests that they are not in fact    
   truisms and you are barking up the wrong tree. Also, you haven't   
   refuted Turing until you address the issue of branching logic   
   predicated on arbitrary program input.   
      
   /Flibble   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)