Rule 90
Elementary cellular automaton based on the exclusive-or function
In the mathematical study of cellular automata, Rule 90 is an elementary cellular automaton based on the exclusive or function. It consists of a one-dimensional array of cells, each of which can hold either a 0 or a 1 value.
Nº Q7378926 ★
Common · Knowledge
Rule 90
Elementary cellular automaton based on the exclusive-or function
In the mathematical study of cellular automata, Rule 90 is an elementary cellular automaton based on the exclusive or function. It consists of a one-dimensional array of cells, each of which can hold either a 0 or a 1 value.
From Wikipedia
In the mathematical study of cellular automata, Rule 90 is an elementary cellular automaton based on the exclusive or function. It consists of a one-dimensional array of cells, each of which can hold either a 0 or a 1 value. In each time step all values are simultaneously replaced by the XOR of their two neighboring values. Martin, Odlyzko & Wolfram (1984) call it "the simplest non-trivial cellular automaton", and it is described extensively in Stephen Wolfram's 2002 book A New Kind of Science. When started from a single live cell, Rule 90 has a time-space diagram in the form of a Sierpiński triangle. The behavior of any other configuration can be explained as a superposition of copies of this pattern, combined using the exclusive or function. Any configuration with only finitely many nonzero cells becomes a replicator that eventually fills the array with copies of itself. When Rule 90 is started from a random initial configuration, its configuration remains random at each time step. Its time-space diagram forms many triangular "windows" of different sizes, patterns that form when a consecutive row of cells becomes simultaneously zero and then cells with value 1 gradually move into this row from both ends. Some of the earliest studies of Rule 90 were made in connection with an unsolved problem in number theory, Gilbreath's conjecture, on the differences of consecutive prime numbers. This rule is also connected to number theory in a different way, via Gould's sequence. This sequence counts the number of nonzero cells in each time step after starting Rule 90 with a single live cell. Its values are powers of two, with exponents equal to the number of nonzero digits in the binary representation of the step number. Other applications of Rule 90 have included the design of tapestries. Every...
Text: Wikipédia, CC BY-SA 4.0. · Image: Eouw0o83hf (CC BY-SA 4.0) ·
Related cards
-
Rule 30
One-dimensional cellular automaton rule with chaotic behavior
Nº Q2918510 ★★
Not listed
-
Cellular automaton
Discrete model studied in computability theory, mathematics, physics, complexity science, theoretical biology and microstructure modeling
Nº Q189156 ★★★
Not listed
-
Von Neumann cellular automaton
Cellular automaton used to model universal construction
Nº Q4056286 ★
Not listed
-
Von Neumann neighborhood
In cellular automata
Nº Q1554323 ★
Not listed
-
Garden of Eden (cellular automaton)
Cellular automaton pattern that cannot be the successor of any other pattern
Nº Q1974793 ★★
Not listed
-
Langton's ant
Two-dimensional Turing machine with emergent behavior
Nº Q460805 ★★★
Not listed