Sketch of a Proof that Conways Life-rule is Universal

5 Sketch of a Proof that Conway s Life-rule is Universal 

Perhaps the simplest way to prove that a system is capable of universal computation - certainly the most straightforward way - is to show that the system in question is formally equivalent to another system that has already been proven to be a universal computer. In this section we sketch a proof of the computational universality of Conway s Life-rule by explicitly constructing dynamical equivalents of all of the computational ingredients required by a conventional digital computer. 

---