# Wolfram numbers

Due to his contributions to their study in the early 1980s, the 1D, r=1, k=2 automata seem to have become associated with the name of Stephen Wolfram.

Consequently the family of the 256 "elementary" cellular automata have come to be known as "Wolfram rules", and the numbers associated with each rule are now often known as "Wolfram numbers".

The Wolfram numbering scheme for his simple cellular automata is described in his 1983 paper, "Statistical Mechanics of Cellular Automata". This paper has been reprinted in the book of his collected papers, entitled "Cellular Automata and Complexity" (Addison Wesley, 1994).

Essentially the idea is to find the states corresponding to neigbourhoods containing ```"111", "110", "101", "100", "011", "010", "001"``` and `"000"`. These are then written down in order, and interpreted as an 8-bit binary number.

For example, the rule described by: ```"111 -> 0", "110 -> 0", "101 -> 0", "100 -> 1", "011 -> 1", "010 -> 1", "001 -> 1"``` and `"000 ->0"`, has an associate rule number of bin_00011110, which is equal to `2 + 4 + 8 + 16`, which is `30` - so this is "rule 30".

Diagram of dependencies of an r=1, 1D cellular automata:

Illustration of how the number of rule 30 is derived from its behaviour:

Wolfram appears not to have been directly responsible for his name becoming associated with these automata, or their numbering scheme.

Tim Tyler | tim@tt1.org | http://cell-auto.com/