Abstract
The Game of Life was created by J.H. Conway. One of the main features of this game is its universality. We prove in this paper this universality with respect to several computational models: boolean circuits, Turing machines, and two-dimensional cellular automata. These different points of view on Life’s universality are chosen in order to clarify the situation and to simplify the original proof. We also present precise definitions of these 3 universality properties and explain the relations between them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albert A. and Culik H. A simple universal cellular automaton and its one-way and totalistic version. Complex Systems, Vol. no. 1: 1–16, 1987.
Banks E. Information processing and transmission in cellular automata. PhD thesis, Mass. Inst. of Tech., Cambridge, Mass, 1971.
Berlekamp E., Conway V., Elwyn R. and Guy R. Winning way for your mathematical plays, volume 2 Academic Press, 1982.
Burks E. Essays on Cellular Automata,University of Illinois Press, 1972.
Codd E. Cellular Automata,Academic Press, 1968.
Durand B. Global properties of cellular automata. in Cellular Automata and Complex Systems, Goles E. and Martinez S., Eds, Kluver, 1998.
Gajardo A. Universality in a 2-dimensional cellular space with a neighborhood of cardinality 3. Preprint, 1998.
Hedlund G. Endomorphism and automorphism of the shift dynamical system. Mathematical System Theory, Vol. no. 3: 320–375, 1969.
Machtley M. and Young P. An introduction to the general theory of algorithms,Elsevier, 1978.
Minsky M. Finite and infinite machines,Prentice-Hall, 1967.
Moore E. Machine models of self-reproduction. Proc. Symp. Apl. Math., Vol. no. 14: 13–33, 1962.
Myhill J. The converse to Moore’s garden-of-eden theorem. Proc. Symp. Apt. Math., Vol. no. 14: 685–686, 1963.
Nourai F. and Kashef S. A universal four states cellular computer. IEEE Transaction on Computers, Vol. 24 no. 8: 766–776, 1975.
Richardson D. Tesselations with local transformations. Journal of Computer and System Sciences, Vol. no. 6: 373–388, 1972.
Rdka Zs. One-way cellular automata on Cayley graphs. Theoretical Computer Science, Vol. no. 132: 259–290, 1994.
Rdka Zs. Simulations between cellular automata on Cayley graphs. To appear Theoretical Computer Science,1998.
Serizawa T. Three state neumann neighbor cellular capable of constructing self reproducing machines. System and Computers in Japan, Vol. 18 no. 4: 33–40, 1987.
Smith III A. Simple computation-universal cellular spaces. Journal of Assoc. Comp. Mach., Vol. 18 no. 3: 233–253, 1971.
Smith III A. Real-time language recognition by one-dimensional cellular automata. Journal of Computer and System Sciences, Vol. no. 6: 233–253, 1972.
Uspensky V. and Semenov A. Algorithms: main ideas and applications. Kluwer, 1993.
von Neumann J. Theory of Self-Reproducing Automata University of Illinois Press, 1966.
Wolfram S. Universality and complexity in cellular automata. in Cellular Automata, Toffoli T., Farmer D. and Wolfram S., Eds, North-Holland, 1–36, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Durand, B., Róka, Z. (1999). The Game of Life: Universality Revisited. In: Delorme, M., Mazoyer, J. (eds) Cellular Automata. Mathematics and Its Applications, vol 460. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-9153-9_2
Download citation
DOI: https://doi.org/10.1007/978-94-015-9153-9_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-5143-1
Online ISBN: 978-94-015-9153-9
eBook Packages: Springer Book Archive