View source for Langton's ant

'''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 tiling|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 [[Turmite|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 ==

* [https://en.wikipedia.org/wiki/Langton%27s_ant Langton's ant] @ Wikipedia


[[Category:Cellular automata]]
[[Category:Turing machines]]