Notes

Chapter 5: Two Dimensions and Beyond


Section 1: Introduction

1D phenomena Other lattices

Section 2: Cellular Automata

Additive rules Cellular automaton art Code 174826 Code 175850 Code 746 Code 942 slices 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] Symmetric 5-neighbor [2D cellular automaton] rules Ulam systems

Section 3: Turing Machines

2D mobile automata History [of 2D Turing machines] Implementation [of 2D Turing machines] Rules [for 2D Turing machines] based on turning Visualization [of 2D Turing machines]

Section 4: Substitution Systems and Fractals

[2D substitution systems with] non-white backgrounds Affine transformations Complex maps Connection [of 2D substitution systems] with digit sequences Connection [of geometric substitution systems] with digit sequences Dragon curve Fractal dimensions Higher-dimensional generalizations [of substitution systems] History of fractals Implementation [of 2D substitution systems] Implementation [of geometric substitution systems] Neighbor-dependent [2D] substitution systems Parameter space sets Penrose tilings Sierpiński pattern Space-filling curves [Substitution systems based on] other shapes The Mandelbrot set Visualization [of geometric substitution systems]

Section 5: Network Systems

Boolean networks Cellular automata on networks Computer science [and network systems] Dimensionality of networks Implementation [of network cellular automata] Implementation [of network systems] Properties [of network systems] Rule structure [for network systems] Sequential network systems [Systems based on] undirected networks

Section 6: Multiway Systems

Formal languages [and multiway systems] Frequency of behavior [in multiway systems] Fundamental physics Game systems General properties [of multiway systems] History [of multiway systems] Implementation [of multiway systems] Limited size versions [of multiway systems] Multidimensional multiway systems Multiway systems based on numbers Multiway tag systems Non-deterministic systems Properties [of multiway system example] Semigroups and groups [and multiway systems]

Section 7: Systems Based on Constraints

1D cellular automata 1D [systems based on] constraints 2D [systems based on] constraints Checking [tilings with] constraints Constraints on formulas Correspondence systems [as constraints] Diophantine equations Enumerating patterns [Excluded blocks in] dynamical systems theory Explanations based on constraints Finite groups and semigroups Forcing nested [2D] patterns Formal languages [and constraints] Ground states of spin systems Identifying the 171 patterns [that satisfy 2D constraints] Linear and nonlinear systems Matrices satisfying constraints Non-computable [2D] patterns Non-periodic pattern [forced by 2D constraint] NP completeness [for 2D constraints] Numbering scheme [for 2D constraints] Other types of [2D] constraints Pattern-avoiding sequences Polyominoes Relation to 1D cellular automata Relation to 2D cellular automata Representing repetitive [2D] patterns Searching for patterns [that satisfy constraints] Sequence equations The notion of equations [versus constraints] Tiling [problems] Undecidability [for 2D constraints]

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