Complexity of Langton's Ant
Anahi Gajardo, Andres Moreira, Eric Goles
Abstract
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.
Create a lesson
Related papers
Computing functions through the orbits of dynamical systems: the case of cellular automata
Niccolò Castronuovo, Alberto Dennunzio, Luciano Margara
Geometry-Controlled Initial-Density Dependence in Branching-Merging Exclusion Processes
Hiroki Yamamoto, Daichi Yanagisawa, Katsuhiro Nishinari
A repeating sequence of simple rules creates a universal computer
Riz Fernando Noronha
Analytical derivation of a three-dimensional fundamental diagram for a real-valued max-plus particle system
Daisuke Takahashi, Junta Matsukidaira, Kazuya Okamoto
Towards New Parity Rules with Asynchronous Updating Inspired by Fatès's Rule
Rolf Hoffmann
Diagonal Bases and Diagonal Periods of Elementary Cellular Automata
Tigran Nersissian