Discover published sets by community

This rule is capable of universal computation which means that it can simulate a Turing machine.

A four-class system used to categorize cellular automata based on their dynamical behavior.

Cellular automata whose rules do not change when the configuration is rotated or reflected.

A two-dimensional universal Turing machine with a very simple set of rules but complex emergent behavior.

A state in cellular automata dynamically poised between order and randomness, often associated with complexity.

A pattern that travels across the board in Conway's Game of Life.

A partitioned cellular automaton scheme where the neighborhood structure changes over time.

The simplest class of one-dimensional cellular automata, consisting of cells with two possible states.

Each cell evolves based on the value of itself and its immediate neighbors, exhibiting complex, chaotic behavior.

A type of cellular automata where the next state of a cell depends on the total, or sum, of the states of its neighbors.

A neighborhood consisting of a central cell and its adjacent cells in a grid-based cellular automaton.

A two-dimensional cellular automaton created by John Horton Conway exhibiting complex emergent behaviors.

Cellular automata where every configuration has a unique predecessor.

Cellular automata where the next state of a cell depends only on its current state and the state of cells in one direction.