Implementation of Logical Functions in the Game of Life

Details Implementation of Logical Functions in the Game of Life Implementation of Logical Functions in the Game of Life

2004-06-04

arxiv.org/abs/cs/0406009v1

Rennard, J.-P. (2002). Implementation of Logical Functions in the Game of Life. In A. Adamatzky (Ed.), Collision-Based Computi

Computer Science

Computational Complexity

17 pages, 28 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Implementation of Logical Functions in the Game of Life does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Implementation of Logical Functions in the Game of Life, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Implementation of Logical Functions in the Game of Life will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-59325