Algebraic Properties of Elementary Cellular Automata

Yuriy Gulak

Why are constructively simple systems such as elementary cellular automata capable of exhibiting complicated spatial behavior? What “mechanisms” are responsible for their randomness and unpredictability? In this talk, we will consider cellular automata as dynamical systems on appropriate algebraic structures (groupoids). We demonstrate how algebraic properties of groupoids are related to the observed dynamical behavior of the corresponding cellular automata.

[presentation materials]

Created by Mathematica  (May 11, 2006)