Recognizing the Repeatable Configurations of Time-Reversible Generalized Langton’s Ant Is PSPACE-Hard
Chris Langton proposed a model of an artificial life that he named “ant”: an agent- called ant- that is over a square of a grid moves by turning to the left (or right) accordingly to black (or white) color of the square where it is heading, and the square then reverses its color. Bunimovich and Trou...
Main Authors: | Takeo Hagiwara, Tatsuie Tsukiji |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2011-01-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/4/1/1/ |
Similar Items
-
Hardness of Approximation for Langton’s Ant on a Twisted Torus
by: Takeo Hagiwara, et al.
Published: (2020-12-01) -
Image Encryption and Decryption System through a Hybrid Approach Using the Jigsaw Transform and Langton’s Ant Applied to Retinal Fundus Images
by: Andrés Romero-Arellano, et al.
Published: (2021-09-01) -
Caracterização aritmética em primeira ordem de funções computáveis em espaço polinomial
by: Felix Lopes da Silva, Emmanuel
Published: (2014) -
Kant and the Nonspatiality of Things in Themselves
by: Weyls, John Matthew
Published: (2016) -
On Computational Hardness of Multidimensional Subtraction Games
by: Vladimir Gurvich, et al.
Published: (2021-02-01)