This site has been permanently archived. This is a static copy provided by the University of Southampton.

TY - GEN ID - cogprints4115 UR - http://cogprints.org/4115/ A1 - Rennard, Jean-Philippe Y1 - 2002/// N2 - 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. PB - Springer KW - cellular automata KW - universal Turing machine KW - Game of Life KW - collision-based computing KW - Boolean algebra TI - Implementation of Logical Functions in the Game of Life SP - 419 AV - public EP - 512 ER -