diff --git a/topics/cellular-automaton/index.md b/topics/cellular-automaton/index.md
new file mode 100644
index 00000000000..000bcb66a3d
--- /dev/null
+++ b/topics/cellular-automaton/index.md
@@ -0,0 +1,15 @@
+---
+aliases: cellular-automata, cellular-automatons
+created_by: Stanisław Ulam, John von Neumann
+display_name: Cellular automaton
+related: automaton, conways-game-of-life
+released: 1940
+short_description: An automaton consisting of cells arranged in a regular grid. A new generation of cells is created with an associated rule.
+topic: cellular-automaton
+wikipedia_url: https://en.wikipedia.org/wiki/Cellular_automaton
+---
+A **cellular automaton** is a discrete [model of computation](https://en.wikipedia.org/wiki/Model_of_computation) studied in [automata theory](https://en.wikipedia.org/wiki/Automata_theory).
+It consists of a regular grid of cells, each in one of a finite number of states; a new generation is created according to some fixed rule that determines the new state of each cell in terms of the current state of the cell and its neighborhood.
+Typically, the rule for updating the state of cells is the same for each cell and does not change over time, and is applied to the whole grid simultaneously, though exceptions are known, such as the [stochastic cellular automaton](https://en.wikipedia.org/wiki/Stochastic_cellular_automaton) and [asynchronous cellular automaton](https://en.wikipedia.org/wiki/Asynchronous_cellular_automaton).
+
+A well-known cellular automaton is [Conway’s Game of Life](https://github.com/topics/conways-game-of-life).