- 1.3k Downloads
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.
KeywordsTuring Machine Finite State Machine Quadratic Assignment Problem Simulated Machine Relative Link
- 1.Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign (2002)Google Scholar
- 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.Chapman, P.: Life universal computer. http://www.igblan.free-online.co.uk/igblan/ca/ (2002)
- 4.Hickerson, D.: Sliding block memory. http://www.radicaleye.com/lifepage/patterns/sbm/sbm.html (1990)
- 6.Trevorrow, A., Rokicki, T.: An open source, cross-platform application for exploring Conway’s Game of Life and other cellular automata. http://golly.sourceforge.net/ (2005)