Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Rule 110
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Definition== In an elementary cellular automaton, a one-dimensional pattern of 0s and 1s evolves according to a simple set of rules. Whether a point in the pattern will be 0 or 1 in the new generation depends on its current value, as well as on those of its two neighbors. [[File:One-d-cellular-automaton-rule-110.gif|thumb|An animation of the way the rules of a 1D cellular automaton determine the next generation, using Rule 110.]] The Rule 110 automaton has the following set of rules: {| class="wikitable" style="text-align: center" |- ! Current pattern | 111 | 110 | 101 | 100 | 011 | 010 | 001 | 000 |- ! New state for center cell | 0 | 1 | 1 | 0 | 1 | 1 | 1 | 0 |} The name "Rule 110" derives from the fact that this rule can be summarized in the binary sequence 01101110; interpreted as a [[binary number]], this corresponds to the decimal value 110. This is the [[Wolfram code]] naming scheme.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)