Implementation of Logical Functions in the Game of Life
Computational Complexity
2007-05-23 v1
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 the 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 glider streams.
Cite
@article{arxiv.cs/0406009,
title = {Implementation of Logical Functions in the Game of Life},
author = {J. -P. Rennard},
journal= {arXiv preprint arXiv:cs/0406009},
year = {2007}
}
Comments
17 pages, 28 figures