liveBook · Manning

Cellular automaton

As explained in Sutskever's List

A cellular automaton is a discrete computational model consisting of cells on a grid whose values update according to local rules.

A cellular automaton represents a system as a grid of cells that update in discrete time steps according to rules. In a coffee-mixing model, each cell represents cream or coffee, and the initial grid separates them with a sharp boundary. section 8.1.1

Different rules represent different physical assumptions. In the interacting model, one adjacent cream–coffee pair swaps at a time, so particles cannot pass through each other. In the noninteracting model, each cream particle moves independently, and multiple particles can occupy the same cell. section 8.1.1

Figure 8.2 Illustration of the construction of the coarse-grained array using an example grain size of 3. The values of the shaded cells on the left are averaged to produce the value of the shaded cell on the right. Used with permission granted by the lead author (Scott Aaronson).
figure

Averaging cells in small groups produces a coarse-grained grid that preserves large-scale patterns while smoothing away fine detail. section 8.1.1

How Sutskever's List covers it

How deep it goes
Defines the grid and contrasts two update rules, then describes coarse-graining and entropy estimation without formal derivation.
Examples
Uses a cream-and-coffee grid to contrast interacting particle swaps with independent particle movement.
What you can do after
Evaluate how different local rules and particle constraints affect simulated mixing.
How it connects
Connects cellular automata with diffusion, coarse-graining, and entropy estimation.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Sutskever's List. The section links point to the parts of the book it draws on.