237
edits
→Rule 110 Cellular Automaton
| Line 115: | Line 115: | ||
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. | 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. | ||
The implementation of Rule 110 is not complicated with the help of softwares. There’re already some good examples written in different languages. I took advantage of one written for Processing by Serdar Ormanli, in order to generate some images of Rule 110. Below is an example run of a rule 110 cellular automaton with 300 generations. | The implementation of Rule 110 is not complicated with the help of softwares. There’re already some good examples written in different languages. I took advantage of one written for Processing by [https://github.com/ormanli/Rule-110 Serdar Ormanli], in order to generate some images of Rule 110. Below is an example run of a rule 110 cellular automaton with 300 generations. | ||
[[File:Rule 110.png|900px]] | [[File:Rule 110.png|900px]] | ||