Cellular automata: a discrete view of the world

Preface

1. Preliminaries

1.1. Self-Replicating Machines

1.2. Grand Turing Machines

1.3. Register Machines

1.4. Logic Gates

1.5. Dimension

1.5.1. Kolmogorov Dimension

1.6. Information and Entropy

1.7. Randomness

2. Dynamical Systems

3. One-Dimensional Cellular Automata

3.1. The Cellular Automaton

3.2. Transition Functions

3.3. Totalistic Rules

3.4. Boundary Conditions

3.5. Some Elementary Cellular Automata

3.6. Additivity

3.7. Reversibility

3.8. Classification of Cellular Automata

3.8.1. Langton's Parameter

3.9. Universal Computation

3.10. Density Problem

3.11. Synchronization

4. Two-Dimensional Automata

4.1. The Game of Life

4.1.1. Lifeforms

4.1.2. Invariant Forms

4.1.3. Oscillators

4.1.4. Gliders

4.1.5. Methuselah Configurations

4.1.6. Garden of Eden

4.1.7. Universal Computation in Life

4.2. Other Automata

4.2.1. Partitioning Cellular Automata

4.3. Replication

4.4. Asynchronous Updating

5. Applications

5.1. Excitable Media

5.1.1. Neural Activity

5.1.2. Cyclic Space

5.1.3. The Hodgepodge Machine

5.2. Schelling Segregation Model

5.3. Prisoner's Dilemma

5.4. Biological Models and Artificial Life

5.4.1. Genetic Algorithms

5.4.2. Predator-Prey

5.4.3. Bacterial Growth

5.4.4. Seashell Patterns

5.5. Physical Models

5.5.1. Diffusion

5.5.2. Snow Crystals

5.5.3. Sandpile Model

5.5.4. Lattice Gases

5.5.5. Ising Spin

5.5.6. Steady-State Heat Flow

5.5.7. The Digital Universe of Konrad Zuse and Edward Fredkin

6. Complexity

6.1. Mind Over Matter

6.2. Random Boolean Networks

6.3. Autonomous Agents

6.3.1. Honey Bees

6.3.2. Slime Molds

6.3.3. Bacterial Colonies

6.3.4. Langton's Ant

6.3.5. Multi-Ant Systems

6.3.6. Traveling Salesman Problem

Appendix A.

References

Index