Skip to main content
Article thumbnail
Location of Repository

Implementation of Logical Functions in the Game of Life

By Jean-Philippe Rennard

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 perations, 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 glider streams

Topics: Complexity Theory
Publisher: Springer
Year: 2002
OAI identifier: oai:cogprints.org:4115

Suggested articles

Citations

  1. (1997). A simple self-reproducing cellular automaton with shape encoding mechanism In: Artificial Life V
  2. (1992). Artificial Life. The quest for a new creation
  3. LogiCell Java applet.
  4. (1998). The Game of Life: universality revisited Research Report 98-01 (Ecole Normale Supéérieure de Lyon, Laboratoire de l'Informatique du Paralléélisme,
  5. (1984). Universality and complexity in cellular automata
  6. (1982). Winning Ways for Your Mathematical Plays,

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.