scholarly journals The computational complexity of the Lorentz lattice gas

1997 ◽  
Vol 87 (5-6) ◽  
pp. 1245-1252 ◽  
Author(s):  
J. Machta ◽  
K. Moriarty
2019 ◽  
Vol 176 (5) ◽  
pp. 1161-1171
Author(s):  
Sameer Kumar ◽  
Shradha Mishra

2020 ◽  
Vol 181 (5) ◽  
pp. 1986-1995
Author(s):  
Pranay Bimal Sampat ◽  
Sameer Kumar ◽  
Shradha Mishra

1991 ◽  
Vol 44 (4) ◽  
pp. 2410-2428 ◽  
Author(s):  
Robert M. Ziff ◽  
X. P. Kong ◽  
E. G. D. Cohen

Algorithms ◽  
2020 ◽  
Vol 13 (12) ◽  
pp. 344
Author(s):  
Takeo Hagiwara ◽  
Tatsuie Tsukiji

Langton’s ant is a deterministic cellular automaton studied in many fields, artificial life, computational complexity, cryptography, emergent dynamics, Lorents lattice gas, and so forth, motivated by the hardness of predicting the ant’s macroscopic behavior from an initial microscopic configuration. Gajardo, Moreira, and Goles (2002) proved that Langton’s ant is PTIME -hard for reachability. On a twisted torus, we demonstrate that it is PSPACE hard to determine whether the ant will ever visit almost all vertices or nearly none of them.


1995 ◽  
Vol 81 (1-2) ◽  
pp. 497-513 ◽  
Author(s):  
J. R. Dorfman ◽  
M. H. Ernst ◽  
D. Jacobs

1993 ◽  
Vol 70 (3-4) ◽  
pp. 793-809 ◽  
Author(s):  
H. van Beijeren ◽  
M. H. Ernst

Sign in / Sign up

Export Citation Format

Share Document