Notes

Chapter 3: The World of Simple Programs


Section 1: The Search for General Features


Section 2: More Cellular Automata

Algebraic forms [for cellular automaton rules] Algebraic forms [for cellular automaton rules] Alternating colors [Cellular automata with] two-cell neighborhoods [Cellular automaton] rules based on algebraic systems Common framework [for cellular automaton rules] Compositions of cellular automata [History of] numbering scheme Implementation of general cellular automata Implementation of totalistic cellular automata Mod 3 [cellular automaton] rule Numbers of [cellular automaton] rules Rule 150 Rule 22 Rule 225 Rule 45 Rule 73 Rule equivalences [for cellular automata] Rule expressions [for cellular automata] Rule orderings [for cellular automata] Special [cellular automaton] rules

Section 3: Mobile Automata

Active cell motion [in mobile automata] Compressed evolution [of mobile automata] Distribution of behavior [in mobile automata] Implementation of generalized mobile automata Implementation [of mobile automata]

Section 4: Turing Machines

Counter [Turing] machine Distribution of behavior [in Turing machines] Head motion [in Turing machines] History [of Turing machines] Implementation [of Turing machines] Localized structures [in Turing machines] Number of [Turing machine] rules Numbering scheme [for Turing machines]

Section 5: Substitution Systems

2D representations [of substitution systems] Connections [of substitution systems] with digit sequences Connections [of substitution systems] with square roots Fibonacci numbers Generalized Fibonacci sequences Growth rates [in substitution systems] History [of substitution systems] Implementation [of substitution systems] Lucas numbers Other examples [of substitution systems] Paperfolding sequences Properties [of substitution systems] Representation [of substitution systems] by paths Spectra of substitution systems

Section 6: Sequential Substitution Systems

Capabilities [of sequential substitution systems] History [of sequential substitution systems] Implementation [of sequential substitution systems] Order of replacements [in sequential substitution systems]

Section 7: Tag Systems

History [of tag systems] Implementation [of tag systems] Randomness [in tag systems]

Section 8: Cyclic Tag Systems

Generalizations [of cyclic tag systems] History [of cyclic tag systems] Implementation [of cyclic tag systems] Mechanical implementation [of cyclic tag systems] Properties [of cyclic tag systems]

Section 9: Register Machines

Extended instruction sets [for register machines] Halting [of register machines] History [of register machines] Implementation [of register machines] Random programs

Section 10: Symbolic Systems

[Enumerating] possible expressions History [of symbolic systems] Implementation [of symbolic systems] Long halting times [in symbolic systems] Network analogs [of symbolic systems] Operator systems Order dependence [in symbolic systems] Other [symbolic systems] rules Properties [of example symbolic system] Representations [for symbolic expressions] Symbolic expressions Trees [representation for symbolic systems]

Section 11: Some Conclusions


Section 12: How the Discoveries in This Chapter Were Made

Attitudes of mathematicians History of experimental mathematics Practicalities [of computer experiments] Repeatability and numerical analysis Studying simple systems The relevance of theorems

From Stephen Wolfram: A New Kind of Science [citation]