Complexity of Langton's ant

@article{Gajardo2002ComplexityOL,
  title={Complexity of Langton's ant},
  author={A. Gajardo and A. Moreira and E. Ch.},
  journal={Discret. Appl. Math.},
  year={2002},
  volume={117},
  pages={41-50}
}
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. 
Hardness of Approximation for Langton's Ant on a Twisted Torus
On Goles' universal machines: A computational point of view
  • Bruno Martin
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2013
A symbolic projection of Langton's Ant
Generalized Langton's Ant: Dynamical Behavior and Complexity
COMPLEXITY OF TWO DIMENSIONAL SANDPILES
Time-symmetric Cellular Automata
Langton's flies
On the Dynamic Qualitative Behavior of Universal Computation
  • H. Zenil
  • Computer Science
  • Complex Syst.
  • 2012
On the Dynamic Qualitative Behaviour of Universal Computation
  • H. Zenil
  • Computer Science, Mathematics
  • ArXiv
  • 2012
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 33 REFERENCES
Behaviour of Multiple Generalized Langton"s Ants
Further Travels with My Ant
Studying artificial life with cellular automata
Tracking the Automatic ANT: And Other Mathematical Explorations
New types of diffusion in lattice gas cellular automata
Propagation and Organization in Lattice Random Media
...
1
2
3
4
...