Get Math Help

Totalistic Cellular Automaton

Definition

A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a neighborhood. These automata were introduced by Wolfram in 1983. Like an elementary cellular automaton, the evolution of a one-dimensional totalistic cellular automaton can completely be described by a table specifying the state a given cell will have in the next generation based on the average value of the three cells consisting of the cell to its left, the value the cell itself, and the value of the cell to its right.

Related Wolfram Language symbol

CellularAutomaton

Why Club Z!?

We're Awesome!

Vestibulum vitae aliquam nunc. Suspendisse mollis metus ac tellus egestas pharetra. Suspendisse at viverra purus. Pellentesque nec posuere ligula, eu congue leo. Integer vulputate tempor arcu. Vestibulum vulputate Vestibulum vitae aliquam nunc. Suspendisse mollis metus ac tellus egestas pharetra. Suspendisse at viverra purus. Pellentesque nec posuere ligula, eu congue leo. Integer vulputate tempor arcu. Vestibulum vulputate

We're Awesome!

Vestibulum vitae aliquam nunc. Suspendisse mollis metus ac tellus egestas pharetra. Suspendisse at viverra purus. Pellentesque nec posuere ligula, eu congue leo. Integer vulputate tempor arcu.