Notes
Chapter 3: The World of Simple Programs
Algebraic forms [for cellular automaton rules]
Algebraic forms [for cellular automaton rules]
[Cellular automata with] two-cell neighborhoods
[Cellular automaton] rules based on algebraic systems
Common framework [for cellular automaton rules]
Compositions of cellular automata
Implementation of general cellular automata
Implementation of totalistic cellular automata
Mod 3 [cellular automaton] rule
Numbers of [cellular automaton] rules
Rule equivalences [for cellular automata]
Rule expressions [for cellular automata]
Active cell motion [in mobile automata]
Compressed evolution [of mobile automata]
Distribution of behavior [in mobile automata]
Distribution of behavior [in Turing machines]
Head motion [in Turing machines]
Implementation [of Turing machines]
Localized structures [in Turing machines]
2D representations [of substitution systems]
Connections [of substitution systems] with digit sequences
Connections [of substitution systems] with square roots
Generalized Fibonacci sequences
Growth rates [in substitution systems]
History [of substitution systems]
Implementation [of substitution systems]
Other examples [of substitution systems]
Properties [of substitution systems]
Capabilities [of sequential substitution systems]
History [of sequential substitution systems]
Generalizations [of cyclic tag systems]
History [of cyclic tag systems]
Implementation [of cyclic tag systems]
Extended instruction sets [for register machines]
Halting [of register machines]
History [of register machines]
[Enumerating] possible expressions
Implementation [of symbolic systems]
Long halting times [in symbolic systems]
Network analogs [of symbolic systems]
Order dependence [in symbolic systems]
Other [symbolic systems] rules
Properties [of example symbolic system]
History of experimental mathematics
Practicalities [of computer experiments]