Advertisement

Game of Life Universal Turing Machine

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

Abstract

This chapter presents a universal Turing machine built from patterns in Conway’s Game of Life cellular automaton by the author. A universal Turing machine program designed to demonstrate this machine is described. It runs in polynomial time. A larger example Turing machine presented which demonstrates the speed of the universal Turing machine. The rebuilding the Turing machine of Chap.  4 with newer tools and expanding it to hold the universal Turing machine program is also described.

Keywords

Turing machineTuring Machine Universal Turing stackStack transitionsTransition Machine Tape 
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.

References

  1. 1.
    Rendell, P.: A simple universal Turing machine for the game of life Turing machine, Chapter 26. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 519–545. Springer, London (2010)CrossRefGoogle Scholar
  2. 2.
    Rendell, P.: Java Applet Turing Machine Simulator. http://www.rendell-attic.org/gol/TMapplet (2009)
  3. 3.
    Rendell, P.: Conway’s Game of Life Turing Machine. www.rendell-attic.org/gol (2000)
  4. 4.
    Bontes, J.: PC Program for Conway’s Game Life. http://psoup.math.wisc.edu/Life32.html (pre 2002)
  5. 5.
    The Python Software Foundation. The Python Language. http://www.python.org (1990)
  6. 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)
  7. 7.
    Gosper, R.: Exploiting regularities in large cellular spaces. Phys. D: Nonlinear Phenom. 10, 75–80 (1984)CrossRefGoogle Scholar
  8. 8.
    Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Upper Saddle River (1967)Google Scholar
  9. 9.
    HP laptop with a 2.67 GHz Dual Core 64bit Intel processor and 3 Gb of RAM running Windows 7Google Scholar
  10. 10.
    Rendell, P.: Universal Turing Machine in Conway’s Game Life. http://www.rendell-attic.org/gol/utm (2000)

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

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

Personalised recommendations