Abstract
The Game of Life cellular automaton is a classical example of a massively parallel collision-based computing device. The automaton exhibits mobile patterns, gliders, and generators of the mobile patterns, glider guns, in its evolution. We show how to construct basic logical operations, AND, OR, NOT in space-time configurations of the cellular automaton. Also decomposition of complicated Boolean functions is discussed. Advantages of our technique are demonstrated on an example of binary adder, realized via collision of gliders’ streams.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Berlekamp E.R., Conway J.H. and Guy R. Winning Ways for Your Mathematical Playsvol 2 (Academic Press, 1982). The structures of our basic gates are introduced in this text.
Durand B. and Roka Z. The Game of Life: universality revisited Research Report 98–01 (Ecole Normale Supérieure de Lyon, Laboratoire de l’Informatique du Parallélisme, 1998)
Levy S.Artificial Life. The quest for a new creation (Penguin Books, 1992)
LogiCell Java applet http://www.nursingworld.org/alife
Morita K. and Imai K. A simple self-reproducing cellular automaton with shape-encoding mechanism In: Artificial Life V (MIT Press, Cambridge, 1997) 489–496
von Neumann J. (Burks A., Editor) Theory of Self-Reproducing Automata (University of Illinois Press, 1966)
Wolfram S. Universality and complexity in cellular automata Physica D 10 (1984) 1–35.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this chapter
Cite this chapter
Rennard, JP. (2002). Implementation of Logical Functions in the Game of Life. In: Adamatzky, A. (eds) Collision-Based Computing. Springer, London. https://doi.org/10.1007/978-1-4471-0129-1_17
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0129-1_17
Publisher Name: Springer, London
Print ISBN: 978-1-85233-540-3
Online ISBN: 978-1-4471-0129-1
eBook Packages: Springer Book Archive