Computational complexity of dynamical systems: The case of cellular automata
Cellular Automata can be considered discrete dynamical systems and at the same time a model of parallel computation. In this paper we investigate the connections between dynamical and computational properties of Cellular Automata. We propose a classification of Cellular Automata according to the complexities which rise from the basins of attraction of subshift attractors and investigate the intersection classes between our classification and other three topological classifications of Cellular Automata. From the intersection classes we can derive some necessary topological properties for a cellular automaton to be computationally universal according to our model. (C) 2008 Elsevier Inc. All rights reserved.
cellular automata classification universality