On the computational power of totalistic cellular automata
From MaRDI portal
Publication:3763596
DOI10.1007/BF01692058zbMath0627.68049MaRDI QIDQ3763596
Publication date: 1987
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Related Items
Cellular automata universality revisited ⋮ Complexity of reachability problems for finite discrete dynamical systems ⋮ On totalistic systolic networks ⋮ Dynamic modularity in discrete-time models of regulatory networks ⋮ On Goles' universal machines: a computational point of view ⋮ Computation theoretic aspects of cellular automata
Cites Work
- Characterizations and computational complexity of systolic trellis automata
- Statistical mechanics of cellular automata
- On Some Open Problems in the Theory of Cellular Automata
- Simple Computation-Universal Cellular Spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item