Cellular Automata (CA)Overview

• Introduction and Purpose

• von Neumann and generalized CA results

• Equivalences with Turing Machines and Shape Grammars

• More general theory

• Example applications

• Simulations

Next slide

Back to first slide

View graphic version