Wolfram code

Wolfram code

Wolfram code is a name often used for the method of enumerating elementary cellular automaton rules used by Stephen Wolfram in his book "A New Kind of Science". [Wolfram, Stephen, " [http://www.wolframscience.com/nksonline A New Kind of Science] ". Wolfram Media, Inc., May 14, 2002. ISBN 1-57955-008-8]

The code is based on the observation that a sequence of "n" cells, each having one of "m" possible states, may be interpreted as an "n"-digit "m"-ary number. The Wolfram code for a particular rule is a number in the range from 0 to "mmn "−1 (where "n" is the size of the neighbourhood), usually expressed in decimal notation, which may be calculated as follows:

# List all the "mn" 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 a number. This 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 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.

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.

References


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Code De Nuremberg — Le Code de Nuremberg est un document établissant une déontologie internationale sur l expérimentation humaine. Il est une conséquence directe des Procès de Nuremberg à la fin de la Seconde Guerre mondiale et constitue une réponse aux expériences… …   Wikipédia en Français

  • Code Nuremberg — Code de Nuremberg Le Code de Nuremberg est un document établissant une déontologie internationale sur l expérimentation humaine. Il est une conséquence directe des Procès de Nuremberg à la fin de la Seconde Guerre mondiale et constitue une… …   Wikipédia en Français

  • Code de nuremberg — Le Code de Nuremberg est un document établissant une déontologie internationale sur l expérimentation humaine. Il est une conséquence directe des Procès de Nuremberg à la fin de la Seconde Guerre mondiale et constitue une réponse aux expériences… …   Wikipédia en Français

  • Wolfram's 2-state 3-symbol Turing machine — In his A New Kind of Science , Stephen Wolfram found a universal 2 state 5 color Turing machine, and [http://www.wolframscience.com/nksonline/page 709 conjectured] that a particular 2 state 3 color Turing machine (hereinafter (2,3) Turing… …   Wikipedia

  • Code of Euric — The Codex Euricianus or Code of Euric was a collection of laws governing the Visigoths compiled at the order of Euric, King of Spain, sometime before 480, probably at Toulouse (possible at Arles); it is one of the earliest examples of early… …   Wikipedia

  • Gray code — The reflected binary code, also known as Gray code after Frank Gray, is a binary numeral system where two successive values differ in only one digit.The reflected binary code was originally designed to prevent spurious output from… …   Wikipedia

  • Barker code — A Barker code is a sequence of N values of +1 and −1,:a j for j = 1, cdotcdotcdot, Nsuch that:|sum {j=1}^{N v} a j a {j+v}| le 1,for all 1 le v < N.Here is a table of all known Barker codes, where negations and reversals of the codes have been… …   Wikipedia

  • Rule 30 — is a one dimensional binary cellular automaton rule introduced by Stephen Wolfram in 1983. [cite journal|author = Wolfram, S.|title = Statistical mechanics of cellular automata|journal = Rev. Mod. Phys.|volume = 55|pages = 601–644|year = 1983|doi …   Wikipedia

  • Rule 184 — is a one dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems:* Rule 184 can be used as a simple model for… …   Wikipedia

  • Life-like cellular automaton — A cellular automaton (CA) is Life like (in the sense of being similar to Conway s Game of Life) if it meets the following criteria: The array of cells of the automaton has two dimensions. Each cell of the automaton has two states (conventionally… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”