Notes
Chapter 5: Two Dimensions and Beyond
General rules [for multidimensional cellular automata]
Growth [2D cellular automaton] rules
History [of 2D cellular automata]
Implementation [of 2D cellular automata]
Limiting shapes [in 2D cellular automata]
Networks [as basis for cellular automata]
Numbers of possible [2D cellular automaton] rules
Other geometries [for cellular automata]
Projections from 3D [cellular automata]
History [of 2D Turing machines]
Implementation [of 2D Turing machines]
[2D substitution systems with] non-white backgrounds
Connection [of 2D substitution systems] with digit sequences
Connection [of geometric substitution systems] with digit sequences
Higher-dimensional generalizations [of substitution systems]
Implementation [of 2D substitution systems]
Implementation [of geometric substitution systems]
Neighbor-dependent [2D] substitution systems
Computer science [and network systems]
Implementation [of network cellular automata]
Implementation [of network systems]
Properties [of network systems]
Formal languages [and multiway systems]
Frequency of behavior [in multiway systems]
General properties [of multiway systems]
Implementation [of multiway systems]
Limited size versions [of multiway systems]
Multidimensional multiway systems
Multiway systems based on numbers
1D [systems based on] constraints
2D [systems based on] constraints
Checking [tilings with] constraints
Correspondence systems [as constraints]
[Excluded blocks in] dynamical systems theory
Explanations based on constraints
Formal languages [and constraints]
Identifying the 171 patterns [that satisfy 2D constraints]
Matrices satisfying constraints
Non-periodic pattern [forced by 2D constraint]
NP completeness [for 2D constraints]
Numbering scheme [for 2D constraints]
Other types of [2D] constraints
Relation to 1D cellular automata
Relation to 2D cellular automata
Representing repetitive [2D] patterns
Searching for patterns [that satisfy constraints]