From: janburse@fastmail.fm   
      
   You bisimilarity is broken   
      
   It shows halting not as a decidable property.   
   If you have M1 ~ M2, and M2 is still not decidable   
   but has the same notion of termination nevertheless,   
      
   means logically you didn't really make any error,   
   only you showed nothing. Not much was gained.   
      
   I guess you need to start all over agan.   
      
   olcott schrieb:   
   > Title: A Structural Analysis of the Standard Halting Problem Proof   
   >   
   > Author: PL Olcott   
   >   
   > Abstract:   
   > This paper presents a formal critique of the standard proof of the   
   > undecidability of the Halting Problem. While we do not dispute the   
   > conclusion that the Halting Problem is undecidable, we argue that the   
   > conventional proof fails to establish this conclusion due to a   
   > fundamental misapplication of Turing machine semantics. Specifically, we   
   > show that the contradiction used in the proof arises from conflating the   
   > behavior of encoded simulations with direct execution, and from making   
   > assumptions about a decider's domain that do not hold under a rigorous   
   > model of computation.   
   >   
   >   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)