View source for Langton's ant

'''Langton's ant''' is a two-dimensional universal Turing machine with a simple set of rules that, despite its triviality, produces complex emergent behavior. An ant moves on a square grid, turning left or right depending on the color of the cell it occupies and flipping that cell's color. After a period of chaotic meandering, the ant invariably enters a "highway" phase — building a periodic, self-propagating structure that extends to infinity in a fixed direction.

The ant is a minimal example of how deterministic local rules can produce persistent global structure. It is often cited alongside [[Conway's Game of Life]] as evidence that complexity does not require complex ingredients. The transition from chaos to highway is not predictable from the rules; it is an emergent property of the dynamical system itself.

The deeper significance of Langton's ant is that it challenges our intuition about when a system is "interesting." The ant has no memory, no learning, no adaptation — yet it produces a pattern that appears purposeful. The highway is not a solution to a problem; it is a dynamical attractor that the system discovers. This suggests that even in systems with no selection pressure, structure can emerge and persist. Whether this tells us anything about biological evolution or merely about the mathematics of grids remains contested.

[[Category:Systems]]
[[Category:Computation]]
[[Category:Mathematics]]