{
  "aliases": null,
  "backlinks": [
    {
      "field": "defines",
      "target": "2CM2MC5HQ6"
    },
    {
      "field": "about",
      "target": "2H1XHWDACH"
    },
    {
      "field": "about",
      "target": "N35QM9G83G"
    },
    {
      "field": "uses",
      "target": "2H1XHWDACH"
    }
  ],
  "body": "\n## Summary\n\nA cellular automaton is a grid of cells, each in one of finitely many states.\nAll cells update at the same time by one local rule.\nThe new state of a cell depends only on the old states of the cells in a fixed finite neighbourhood.\nAs a dynamical system it is a continuous map of the configuration space that commutes with the shifts, by the [[Curtis–Hedlund–Lyndon theorem|N35QM9G83G]].\nVery simple rules can produce complex behaviour, so cellular automata serve as models in physics and biology and as a model of computation.\n\n## Explanations\n\n### L1 human\n\nImagine a row of light bulbs, each on or off.\nAt each tick of a clock, every bulb looks at itself and its two neighbours and decides whether to be on or off by a fixed table.\nAll bulbs follow the same table and switch at the same moment.\nIn rule 90, a bulb is on at the next tick exactly when one of its two neighbours, but not both, is on now.\nStarted from a single lit bulb, this rule draws a Sierpinski triangle over time.\nConway's Game of Life is a famous two-dimensional example.\nSee the [[definition|2CM2MC5HQ6]].\n",
  "commit": "ff8a40749dc16545e3d2fc637f6b0196e81d0bfa",
  "front": {
    "kind": "concept",
    "msc": [
      "37B15",
      "68Q80"
    ],
    "name": "Cellular automaton",
    "same_as": {
      "wikidata": "Q189156",
      "wikipedia": "Cellular automaton"
    },
    "sources": [
      {
        "url": "https://en.wikipedia.org/wiki/Cellular_automaton"
      }
    ],
    "tag": "5QXNC6NTVN"
  },
  "kind": "concept",
  "link": "https://tamnd.github.io/math2/node/5QXNC6NTVN/",
  "links": null,
  "markdown": "https://tamnd.github.io/math2/node/5QXNC6NTVN.md",
  "msc": [
    "37B15",
    "68Q80"
  ],
  "name": "Cellular automaton",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/5QX/5QXNC6NTVN.md",
  "status": null,
  "tag": "5QXNC6NTVN",
  "uri": "m2://5QXNC6NTVN",
  "url": "https://tamnd.github.io/math2/wiki/cellular-automaton/",
  "writing": {
    "tag": "5QXNC6NTVN",
    "kind": "concept",
    "level": "W0",
    "next": [
      {
        "what": "a source with a locator",
        "have": 0,
        "want": 1
      }
    ]
  }
}