Implementation of Logical Functions in the Game of Life
暂无分享,去创建一个
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.
[1] B. Durand,et al. The Game of Life: Universality Revisited , 1999 .
[2] S. Levy. Artificial life: the quest for a new creation , 1992 .
[3] A. Blokhuis. Winning ways for your mathematical plays , 1984 .
[4] Stephen Wolfram,et al. Universality and complexity in cellular automata , 1983 .
[5] John von Neumann,et al. Theory Of Self Reproducing Automata , 1967 .