Rule 30

From Wiki @ Karl Jones dot com
Revision as of 07:38, 4 January 2018 by Karl Jones (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Rule 30 is a one-dimensional binary cellular automaton rule introduced by Stephen Wolfram in 1983.

Description

Using Wolfram's classification scheme, Rule 30 is a Class III rule, displaying aperiodic, chaotic behavior.

This rule is of particular interest because it produces complex, seemingly random patterns from simple, well-defined rules.

Because of this, Wolfram believes that Rule 30, and cellular automata in general, are the key to understanding how simple rules produce complex structures and behavior in nature.

For instance, a pattern resembling Rule 30 appears on the shell of the widespread cone snail species Conus textile.

Rule 30 has also been used as a random number generator in Mathematica, and has also been proposed as a possible stream cipher for use in cryptography.

Rule 30 is so named because 30 is the smallest Wolfram code which describes its rule set.

The mirror image, complement, and mirror complement of Rule 30 have Wolfram codes 86, 135, and 149, respectively.

See also

External links