Update
This commit is contained in:
parent
3faa368f53
commit
1c29f051c3
8 changed files with 34 additions and 21 deletions
|
@ -21,6 +21,8 @@ For rule 110 the following is a table determining the next value of a cell given
|
|||
|
||||
The rightmost column is where elementary cellular automata differ from each other -- here reading the column from top to bottom we get the [binary](binary.md) number 01101110 which is 110 in [decimal](decimal.md), hence we call the automaton rule 110. Some automata behave as "flipped" versions of rule 110, e.g. rule 137 (bit inversion of rule 110) and rule 124 (horizontal reflection of rule 110) -- these are in terms of properties equivalent to rule 110.
|
||||
|
||||
Fun fact: a [mechanical](mechanical.md) computer based on rule 110 can be made with marbles, it's very simple (there's a video somewhere on the Internet).
|
||||
|
||||
The following is an output of 32 steps of rule 110 from an initial tape with one cell set to 1. Horizontal dimension represents the tape, vertical dimension represents steps/time (from top to bottom).
|
||||
|
||||
```
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue