Update
This commit is contained in:
parent
4533fde60c
commit
8fbedc9460
39 changed files with 1945 additions and 1823 deletions
|
@ -1,6 +1,6 @@
|
|||
# Rule 110
|
||||
|
||||
*Not to be confused with [rule 34](rule43.md) xD*
|
||||
*Not to be [confused](often_confused.md) with [rule 34](rule43.md) xD*
|
||||
|
||||
Rule 110 is a specific [cellular automaton](cellular_automaton.md) (similar to e.g. [Game of Life](game_of_life.md)) which shows a very interesting behavior -- it is one of the simplest [Turing complete](turing_completeness.md) (computationally most powerful) systems with a balance of stable and [chaotic](chaos.md) behavior. In other words it is a system in which a very complex and interesting properties emerge from extremely simple rules. The name *rule 110* comes from [truth table](truth_table.md) that defines the automaton's behavior. Its **extreme simplicity** combined with full computational power is what makes rule 110 of great interest -- for example it can relatively easily be implemented as a [mechanical computer](mechanical.md) using only marbles and a very simple maze (there's a video somewhere on the Internet).
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue