Examples for

# Cellular Automata

A simple model capable of complex behavior, a cellular automaton is a computational system where many identical cells on a lattice update their color according to a local and constant rule of evolution. Cellular automata have been shown to exhibit diverse behaviors, including chaos and complexity. Wolfram|Alpha can help you investigate any of trillions of rules or an entire rule space; compute transition diagrams, Boolean forms and algebraic forms; and visualize the evolution of these rules from simple and random initial conditions.

### Elementary Cellular Automata

Perform computations with elementary cellular automata, including rule 30 and rule 110, and learn about their properties.

#### Compute properties of an elementary cellular automaton:

#### Specify random initial conditions:

#### Compute a property of an elementary cellular automaton:

### Totalistic Cellular Automata

See totalistic cellular automata evolve, get information about them, and see their transition diagrams.

#### Specify a totalistic cellular automaton:

### General 1D Cellular Automata

Specify, simulate and analyze any one-dimensional cellular automaton by its rule number, its number of neighbors (or range) and the number of colors.