auto
small
medium
large
x-large
Notes
Chapter 2
Section 1
Jump to page
Lookup in index
Search
‹
›
Notes
Chapter 2:
The Crucial Experiment
Section 1:
How Do Simple Programs Behave?
Implementing cellular automata
Bitwise optimizations [of cellular automata]
More general [cellular automaton] rules
Built-in cellular automaton function
Special-purpose hardware [for cellular automata]
Audio representation [of cellular automata]
Cellular automaton rules as formulas
Mathematical interpretation of cellular automata
Pascal's triangle and rule 90
Self-similarity [of rule 90]
Another initial condition [for rule 90]
More colors [in additive cellular automata]
History [of Pascal's triangle mod k]
[Patterns from] other integer functions
[Patterns from] bitwise functions
Tests of randomness
Rule 30
Rule 110