Complexity of Langton's ant

The virtual ant introduced by Langton [Physica D 22 (1986) 120] has an interesting behavior, which has been studied in several contexts. Here we give a construction to calculate any boolean circuit with the trajectory of a single ant. This proves the P-hardness of the system and implies, through the simulation of one-dimensional cellular automata and Turing machines, the universality of the ant and the undecidability of some problems associated to it. ? 2002 Elsevier Science B.V. All rights reserved.

• Type: Journal
• Year: 2002
• Where: DAM
• Authors: Anahí Gajardo, Andrés Moreira, Eric Goles Ch.
• Keywords: DAM 2002, One-dimensional Cellular Automata, Single Ant, Virtual Ant