Implementation of Logical Functions in the Game of Life
J.-P. Rennard
TL;DR
This paper demonstrates how to implement basic logical functions and complex Boolean operations within Conway's Game of Life cellular automaton, showcasing the potential for collision-based computation and applications like binary addition.
Contribution
It introduces methods to realize logical gates and Boolean functions in the Game of Life, including a binary adder, advancing collision-based computing techniques.
Findings
Logical AND, OR, NOT implemented in Game of Life
Decomposition of complex Boolean functions shown
Binary adder constructed using glider collisions
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCognitive Science and Mapping · Psychological Treatments and Assessments