• Paul RendellEmail author
Part of the Emergence, Complexity and Computation book series (ECC, volume 18)


Cellular automata such as Conway’s Game of Life continue to provide a useful method for exploring how complex behaviour can emerge from very simple rules. Proof of the universality of the Game of Life was provided by Conway himself in 1982. The objective in providing a Turing machine proof of universality for Conway’s Game of Life is to make the proof of universality available to a wider audience by restricting the proof to widely known mathematical concepts.


Turing Machine Finite State Machine Quadratic Assignment Problem Simulated Machine Relative Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign (2002)Google Scholar
  2. 2.
    Berlekamp, E., Conway, J., Guy, R.: What is life (Chapter 25). Winning Ways for Your Mathematical Plays, vol. 2. Academic Press, London (1982)Google Scholar
  3. 3.
    Chapman, P.: Life universal computer. (2002)
  4. 4.
    Hickerson, D.: Sliding block memory. (1990)
  5. 5.
    Rogozhin, Y.: Small universal Turing machines. Theor. Comput. Sci. 168(2), 215–240 (1996)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Trevorrow, A., Rokicki, T.: An open source, cross-platform application for exploring Conway’s Game of Life and other cellular automata. (2005)
  7. 7.
    Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1–35 (1984)MathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of the West of EnglandBristolUK

Personalised recommendations