(Enter summary)
Abstract: . We show that if a cellular automaton in two or more dimensions
supports growing "ladders" which can turn or block each other,
then it can express arbitrary Boolean circuits. Then the problem of predicting
the CA for a finite amount of time becomes P-complete, the
question of whether a finite configuration grows to infinity is P-hard,
and the long-term behavior of initial conditions with a periodic background
is undecidable.
This class includes the "Life without Death" rule, in which cells... (Update)
Context of citations to this paper: More
...P complete. A similar technique was used by Griffeath and Moore to prove the P completeness of certain two dimensional cellular automata [29]. A simple modification of either proof shows that construction of motorcycle graphs is also Pcomplete, even when the motorcycles move...
...P complete. A similar technique was used by Griffeath and Moore to prove the P completeness of certain twodimensional cellular automata [32]. A simple modification of either proof shows that construction of motorcycle graphs is also P complete, even when the motorcycles move...
Cited by: More
Internal Diffusion-Limited Aggregation: Parallel Algorithms.. - Moore, Machta
(Correct)
Raising Roofs, Crashing Cycles, and Playing Pool.. - Eppstein, Erickson (1999)
(Correct)
Active bibliography (related documents): More All
0.9: Predicting Lattice Gases is P-complete - Moore, Nordahl (1997)
(Correct)
0.6: Predicting Non-linear Cellular Automata Quickly by Decomposing.. - Moore (1997)
(Correct)
0.6: Parallel Computational Complexity in Statistical Physics - Moriarty, al. (1997)
(Correct)
Similar documents based on text: More All
0.1: The Swarm Simulation System: A Toolkit for Building .. - Minar, Burkhart.. (1996)
(Correct)
0.1: An Analog Characterization of the Subrecursive Functions - Campagnolo, Moore, Costa (2000)
(Correct)
0.1: Iteration, Inequalities, and Differentiability in Analog.. - Campagnolo, Moore, Costa
(Correct)
Related documents from co-citation: More All
3: Automatic mesh generation using the symmetric axis transform of polygonal domain.. (context) - Srinivasan, Nackman et al. - 1992
3: Collision detection for interactive graphics applications
- Hubbard - 1995
3: A computational algorithm for origami design (context) - Lang - 1996
BibTeX entry: (Update)
D. Griffeath and C. Moore. Life Without Death is Pcomplete. Working Paper 97-05-044, Santa Fe Institute, 1997. To appear in Complex Systems. hhttp:// psoup:math:wisc:edu/java/lwodpc/lwodpc:htmli. http://citeseer.ist.psu.edu/griffeath97life.html More
@article{ griffeath96life,
author = "Griffeath and Moore",
title = "Life Without Death is {P}-complete",
journal = "COMPSYSTS: Complex Systems",
volume = "10",
year = "1996",
url = "citeseer.ist.psu.edu/griffeath97life.html" }
Citations (may not include all citations):
951
Computational Complexity (context) - Papadimitriou - 1994
97
Limits to Parallel Computation: P- Completeness Theory
- Greenlaw, Hoover et al. - 1995
86
Conservative logic (context) - Fredkin, Toffoli - 1982
37
Universal Computation in Simple OneDimensional Cellular Auto.. (context) - Lindgren, Nordahl - 1990
16
Quasi-linear cellular automata
- Moore - 1997
13
Two-dimensional cellular automata (context) - Packard, Wolfram - 1985
10
The computational complexity of sandpiles (context) - Moore
9
Non-Abelian cellular automata
- Moore
8
The computational complexity of generating random fractals
- Machta, Greenlaw - 1996
7
A theory of strict P-completeness
- Condon - 1992
3
Majority-Vote Cellular Automata, Ising Dynamics, and P- Comp..
- Moore
2
Lattice Gas Prediction is P-complete (context) - Moore, Nordahl
1
WinCA: a cellular automaton modeling environment (context) - Fisch, Griffeath - 1996
1
Primordial Soup Kitchen (context) - Griffeath
1
Cellular automaton growth on Z 2 : theorems (context) - Gravner, Griffeath
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.santafe.edu.html): More
ECA 18 Temporal Decay - Crutchfield, Hanson
(Correct)
Stochastic Modeling and Optimization of Phage Display - Levitan (1997)
(Correct)
An Agent Based Model for the Study of Publicity/consumer Dynamics. - Prieto
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC