A Full Computation-relevant Topological Dynamics Classification of Elementary Cellular Automata

Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and chaoticity. The "complex" ECA emerge to be sensitive, but not chaotic and not eventually weakly periodic. Based on this classification, we conjecture that elementary cellular automata capable of carrying out complex computations, such as needed for Turing-universality, are at the "edge of chaos"

Generalized Semi-Markovian Process Algebra

S. All local authors can be reached via e-mail at the address [email protected]. Questions and comments should be addressed to [email protected]. Recent Titles from the UBLCS Technical Report Series 95-15 On Programming with View Synchrony, O. Babao glu, A. Bartoli, G. Dini, September 1995. 95-16 Generative Communication in Process Algebra, P. Ciancarini, R. Gorrieri, G. Zavattaro, October 1995. 95-17 Dynamic Declustering Methods for Parallel Grid Files, P. Ciaccia, A. Veronesi, November 1995. 95-18 Group Membership and View Synchrony in Partitionable Asynchronous Distributed Systems: Specifications, O. Babao glu, R. Davoli, A. Montresor, November 1995 (Revised September 1996). 96-1 An Investigation on the Optimal Implementation of Processes, C. Laneve, January 1996. 96-2 Expansivity, Permutivity, and Chaos for Cellular Automata, F. Fagnani, L. Margara, January 1996. 96-3 Enriched View Synchrony: A Paradigm for Programming Dependable Applications in Partitionable Asynchronou..