Langton's ant

Langton's ant
Langton's ant after 11000 steps. A red pixel shows the ant's location.

Langton's ant is a two-dimensional Turing machine with a very simple set of rules but complicated emergent behavior. It was invented by Chris Langton in 1986 and runs on a square lattice of black and white cells.[1] The universality of Langton's ant was proven in 2000.[2] The idea has been generalized in several different ways, such as turmites which add more colors and more states.

Contents

Rules

Animation of first 200 steps of Langton's ant

Squares on a plane are colored variously either black or white. We arbitrarily identify one square as the "ant". The ant can travel in any of the four cardinal directions at each step it takes. The ant moves according to the rules below:

  • At a white square, turn 90° right, flip the color of the square, move forward one unit
  • At a black square, turn 90° left, flip the color of the square, move forward one unit

These simple rules lead to surprisingly complex behavior: after an initial period of apparently chaotic behavior, that lasts for about 10,000 steps (in the simplest case), the ant starts building a recurrent "highway" pattern of 104 steps that repeat indefinitely. All finite initial configurations tested eventually converge to the same repetitive pattern suggesting that the "highway" is an attractor of Langton's ant, but no one has been able to prove that this is true for all such initial configurations. It is only known that the ant's trajectory is always unbounded regardless of the initial configuration[3] - this is known as the Cohen-Kung theorem.[4]

Langton's ant can also be described as a cellular automaton, where most of the grid is colored black or white, and the "ant" square has one of eight different colors assigned to encode the combination of black/white state and the current direction of motion of the ant.

Universality

In 2000, Gajardo et al. showed a construction that calculates any boolean circuit using the trajectory of a single instance of Langton's ant.[2] Thus, it would be possible to simulate a Turing machine using the ant's trajectory for computation. This means that the ant is capable of universal computation.

Extension to multiple colors

Greg Turk and Jim Propp considered a simple extension to Langton's ant where instead of just two colors, more colors are used.[5] The colors are modified in a cyclic fashion. A simple naming scheme is used: for each of the successive colors, a letter 'L' or 'R' is used to indicate whether a left or right turn should be taken. Langton's ant has the name 'RL' in this naming scheme.

Some of these extended Langton's ants produce patterns that become symmetric over and over again. One of the simplest examples is the ant 'RLLR'. One sufficient condition for this to happen is that the ant's name, seen as a cyclic list, consists of consecutive pairs of identical letters 'LL' or 'RR' (the term "cyclic list" indicates that the last letter may pair with the first one.) The proof involves Truchet tiles.

Extension to multiple states

A further extension of Langton's Ants is to consider multiple states of the Turing machine - as if the ant itself has a color that can change. These ants are called turmites, a contraction of "Turing machine termites". Common behaviours include the production of highways, chaotic growth and spiral growth.[6]

Extension to multiple ants

Multiple Langton's Ants can co-exist on the 2D plane, and their interactions give rise to complex, higher order automata that collectively build a wide variety of organized structures. There is no need for conflict-resolution as every ant sitting on the same square wants to make the same change to the tape. There is a YouTube video showing these multiple ant interactions.

Multiple turmites can co-exist on the 2D plane as long as there is a rule for what happens when they meet. Ed Pegg, Jr. considered turmites that can turn for example both left and right, splitting in two and annihilating each other when they meet.[7]

See also

References

  1. ^ Langton, Chris G. (1986). "Studying artificial life with cellular automata". Physica D: Nonlinear Phenomena 22 (1-3): 120–149. doi:10.1016/0167-2789(86)90237-X. hdl:2027.42/26022. 
  2. ^ a b Gajardo, A.; A. Moreira, E. Goles (15 March 2002). "Complexity of Langton's ant". Discrete Applied Mathematics 117 (1-3): 41–50. doi:10.1016/S0166-218X(00)00334-6. http://www.dim.uchile.cl/~anmoreir/oficial/langton_dam.pdf. 
  3. ^ Bunimovich, Leonid A.; Serge E. Troubetzkoy (1992). "Recurrence properties of Lorentz lattice gas cellular automata". Journal of Statistical Physics 67 (1-2): 289–302. doi:10.1007/BF01049035. 
  4. ^ Weisstein, Eric W., "Cohen-Kung Theorem" from MathWorld.
  5. ^ Gale, D.; J. Propp, S. Sutherland, S.Troubetzkoy (1995). "Further Travels with My Ant". Mathematical Entertainments column, Mathematical Intelligencer 17: 48–56. http://www.math.sunysb.edu/cgi-bin/preprint.pl?ims95-1. 
  6. ^ Pegg, Jr., Ed. Turmite. From MathWorld--A Wolfram Web Resource, created by Eric W. Weisstein. http://mathworld.wolfram.com/Turmite.html. Retrieved 15 October 2009 .
  7. ^ Pegg, Jr., Ed. "Math Puzzle". http://www.mathpuzzle.com/26Mar03.html. Retrieved 15 October 2009 .

External links

 
Search Wikimedia Commons
   Wikimedia Commons has media related to:

Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Langton's ant — Christopher Langtons Ameise ist eine Turingmaschine mit einem zweidimensionalen Speicher und ein Beispiel dafür, dass ein deterministisches (das heißt nicht zufallsbedingtes) System aus einfachen Regeln zu sowohl komplex chaotischen, als auch… …   Deutsch Wikipedia

  • Langton — may refer to:In places: *Langton, Cumbria, England *Langton, County Durham, England *Langton, Lincolnshire, England *Langton, North Yorkshire, England *Langton, Ontario, Canada *Langton, Pembrokeshire, WalesPeople with the surname Langton:… …   Wikipedia

  • Langton's loops — Langton s Loop, in the starting configuration. Langton s loops are a particular species of artificial life in a cellular automaton created in 1984 by Christopher Langton. They consist of a loop of cells containing genetic information, which flows …   Wikipedia

  • Ant (disambiguation) — An ant is a eusocial insect that belongs to the same order as wasps and bees.Ant, Ants, or ANT may refer to:*Ant hill, a pile of materials that build up at the entrances of the subterranean dwellings of ant colonies as they are excavated * The… …   Wikipedia

  • Christopher Langton — Born 1948/1949 Nationality American Alma mater …   Wikipedia

  • Fourmi De Langton — On nomme fourmi de Langton un automate cellulaire (voir : machine de Turing) bidimensionel comportant un jeu de règles très simples. Elle fut inventée par Chris Langton dont on lui a donné le nom. Elle constitue l un des systèmes les plus… …   Wikipédia en Français

  • Fourmi de langton — On nomme fourmi de Langton un automate cellulaire (voir : machine de Turing) bidimensionel comportant un jeu de règles très simples. Elle fut inventée par Chris Langton dont on lui a donné le nom. Elle constitue l un des systèmes les plus… …   Wikipédia en Français

  • Fourmi de Langton — On nomme fourmi de Langton un automate cellulaire (voir machine de Turing) bidimensionnel comportant un jeu de règles très simples. On lui a donné le nom de Chris Langton, son inventeur. Elle constitue l un des systèmes les plus simples… …   Wikipédia en Français

  • List of PSPACE-complete problems — Here are some of the more commonly known problems that are PSPACE complete when expressed as decision problems. This list is in no way comprehensive. Games and puzzles Generalized versions of: Amazons· Atomix· Geography· Gomoku· Hex· Reversi·… …   Wikipedia

  • Wireworld — [ diodes, the above one in conduction direction, the lower one in reverse biasing] Wireworld is a well known cellular automaton first proposed by Brian Silverman in 1987, as part of his program Phantom Fish Tank. It subsequently became more… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”