Advertisement

Background

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

Abstract

The background material is presented giving a description of Conway’s Game of Life, Turing machines and Counter Machines. The details of the rules for Game of Life are given along with the details of some of the most well known patterns. The operational cycle of a Turing machine is explained as well as an outline for a universal Turing machine. A simple Turing machine is presented while introducing the notation used to describe Turing machines in later chapters. Counter machines are described with an example instruction set and very simple program. Conway’s proof of the universality of the Game of Life is outlined with descriptions of the logical components he proposed.

Keywords

Cellular Automaton Turing Machine Finite State Machine Alphabet Size Counter Machine 
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.
    Gardner, M.: Mathematical games: the fantastic combinations of John Conway’s new solitaire game ‘life’. Sci. Am. 223, 120–123 (1970)CrossRefGoogle Scholar
  2. 2.
    Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1–35 (1984)MathSciNetGoogle Scholar
  3. 3.
    Cook, M.: Universality in elementary cellular automata. Complex Syst. 15(1), 1–40 (2004)Google Scholar
  4. 4.
    Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign (2002)Google Scholar
  5. 5.
    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
  6. 6.
    Kleene, S.C.: Introduction to Metamathematics. North-Holland Publishing Company/Wolters-Noordhoff Publishing, Amsterdam (1952)Google Scholar
  7. 7.
    Turing, A.M.: On computable numbers, with applications to the Entscheidungs Problem. Proc. Lond. Math. Soc. 2, 230–265 (1937)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)Google Scholar
  9. 9.
    Rogozhin, Y.: Small universal Turing machines. Theor. Comput. Sci. 168(2), 215–240 (1996). ISSN 0304-3975Google Scholar
  10. 10.
    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
  11. 11.
    Britton, S.: Java Applet Turing Machine Simulator. http://ironphoenix.org/tril/tm/ (2009)
  12. 12.
    Moore, C., Mertens, S.: The Nature of Computation. Oxford University Press, Oxford (2011)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

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

Personalised recommendations