Difference between revisions of "Langton's ant"
From Wiki @ Karl Jones dot com
Karl Jones (Talk | contribs) (→Description) |
Karl Jones (Talk | contribs) (→See also) |
||
| Line 12: | Line 12: | ||
* [[Cellular automata]] | * [[Cellular automata]] | ||
| + | * [[Christopher Langton]] | ||
* [[Conway's Game of Life]] | * [[Conway's Game of Life]] | ||
* [[Langton's loops]] | * [[Langton's loops]] | ||
Latest revision as of 10:24, 8 May 2016
Langton's ant is a two-dimensional Turing machine with a very simple set of rules but complex emergent behavior.
Description
It was invented by Christopher Langton in 1986 and runs on a square lattice of black and white cells.
The Turing completeness of Langton's ant was proven in 2000.
The idea has been generalized in several different ways, such as turmites which add more colors and more states.
See also
- Cellular automata
- Christopher Langton
- Conway's Game of Life
- Langton's loops
- Paterson's worms
- Turmites
External links
- Langton's ant @ Wikipedia
