Wolfram code
Wolfram code is a naming system often used for one-dimensional cellular automaton rules, introduced by Stephen Wolfram in a 1983 paper and used in his book "A New Kind of Science".

The code is based on the observation that a table specifying the new state of each cell in the automaton, as a function of the states in its neighborhood, may be interpreted as a "k"-digit number in the "S"-ary positional number system, where "S" is the number of states that each cell in the automaton may have, "k" = S2"n" + 1 is the number of neighborhood configurations, and "n" is the radius of the neighborhood. Thus, the Wolfram code for a particular rule is a number in the range from 0 to "S""S" − 1, converted from "S"-ary to decimal notation. It may be calculated as follows:

# List all the "S"2"n" + 1 possible state configurations of the neighbourhood of a given cell.
# Interpreting each configuration as a number as described above, sort them in descending numerical order.
# For each configuration, list the state which the given cell will have, according to this rule, on the next iteration.
# Interpret the resulting list of states again as an "S"-ary number, and convert this number to decimal. The resulting decimal number is the Wolfram code.

The Wolfram code does not specify the size (nor shape) of the neighbourhood, nor the number of states — these are assumed to be known from context. When used on their own without such context, the codes are often assumed to refer to the class of elementary cellular automata, two-state one-dimensional cellular automata with a (contiguous) three-cell neighbourhood, which Wolfram extensively investigates in his book. Notable rules in this class include rule 30, rule 110, and rule 184. Rule 90 is also interesting because it creates Pascal's Triangle modulo 2. A code of this type suffixed by an R, such as "Rule 37R", indicates a second-order cellular automaton with the same neighborhood structure.

While in a strict sense every Wolfram code in the valid range defines a different rule, some of these rules are isomorphic and usually considered equivalent. For example, rule 110 above is isomorphic with the rules 124, 137 and 193, which can be obtained from the original by left-right reflection and by renumbering the states. By convention, each such isomorphism class is represented by the rule with the lowest code number in it. A disadvantage of the Wolfram notation, and the use of decimal notation in particular, is that it makes such isomorphisms harder to see than some alternative notations. Despite this, it has become the de facto standard way of referring to one-dimensional cellular automata.
Q189156
cellular automaton
Concept
Q310798
Stephen Wolfram
PER
Q2987018
A New Kind of Science
MEDIA
Q81365
decimal
Concept
Q1875447
elementary cellular automata
Concept
Q2918510
rule 30
MISC
Q1876486
rule 110
DIS
Q2183161
rule 184
MISC
Q7378926
Rule 90
ORG
Q177051
Pascal's Triangle
Concept
Q7442974
second-order cellular automaton
Concept
Q189112
isomorphic
Concept
Q385853
de facto standard
Concept
Q8030198
Wolfram code
UNK
Q8030198
Wolfram code
UNK
Q8030198
Wolfram code
UNK
Q8030198
Wolfram code
UNK
Q8030198
Wolfram code
UNK
1983-01-01T00:00:00Z^^http://www.w3.org/2001/XMLSchema#dateTime
1983
DATE
+2^^http://www.w3.org/2001/XMLSchema#decimal
2
NUMBER
+1^^http://www.w3.org/2001/XMLSchema#decimal
1
NUMBER
0^^http://www.w3.org/2001/XMLSchema#decimal
0
NUMBER
+1^^http://www.w3.org/2001/XMLSchema#decimal
1
NUMBER
+2^^http://www.w3.org/2001/XMLSchema#decimal
2
NUMBER
+1^^http://www.w3.org/2001/XMLSchema#decimal
1
NUMBER
+30^^http://www.w3.org/2001/XMLSchema#decimal
30
NUMBER
+90^^http://www.w3.org/2001/XMLSchema#decimal
90
NUMBER
+2^^http://www.w3.org/2001/XMLSchema#decimal
2
NUMBER
+37^^http://www.w3.org/2001/XMLSchema#decimal
37
NUMBER
notable work
author