Complexity of Langton's Ant

Details Complexity of Langton's Ant Complexity of Langton's Ant

2003-06-13

arxiv.org/abs/nlin/0306022v2

Final version in Discrete Applied Mathematics, Vol. 117, Issue 1-3, pp. 41-50 (2002)

Nonlinear Sciences

Cellular Automata and Lattice Gases

8 pages, 9 figures. Complements at http://www.dim.uchile.cl/~agajardo/langton

Scientific paper

The virtual ant introduced by C. Langton 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.

Affiliated with

Also associated with

No associations

Rating

Complexity of Langton's Ant does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of Langton's Ant, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Langton's Ant will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26847