Computing Issues of Asynchronous CA

Authors:
Alberto Dennunzio;Enrico Formenti;Luca Manzoni
Affiliations:
Università degli Studi di Milano--Bicocca, Dipartimento di Informatica, Sistemistica e Comunicazione, Viale Sarca 336, 20126 Milano, Italy, dennunzio@disco.unimib.it;Université Nice-Sophia Antipolis, Laboratoire I3S, 2000 Route des Colles, 06903 Sophia Antipolis, France, enrico.formenti@unice.fr;Università degli Studi di Milano--Bicocca, Dipartimento di Informatica, Sistemistica e Comunicazione, Viale Sarca 336, 20126 Milano, Italy, luca.manzoni@disco.unimib.it
Venue:
Fundamenta Informaticae
Year:
2012

Citing 19
Cited 0

Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Evolution in asynchronous cellular automata

ICAL 2003 Proceedings of the eighth international conference on Artificial life
Solution of some conjectures about topological properties of linear cellular automata

Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Delay-insensitive computation in asynchronous cellular automata

Journal of Computer and System Sciences
Fully asynchronous behavior of double-quiescent elementary cellular automata

Theoretical Computer Science
A Predator-Prey Cellular Automaton with Parasitic Interactions and Environmental Effects

Fundamenta Informaticae
Shifting and Lifting of Cellular Automata

CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Decidable Properties of 2D Cellular Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Non-uniform Cellular Automata

LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Conservation of some dynamical properties for operations on cellular automata

Theoretical Computer Science
Sand automata as cellular automata

Theoretical Computer Science
On the directional dynamics of additive cellular automata

Theoretical Computer Science
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority

Theoretical Computer Science
A full cellular automaton to simulate predator-prey systems

ACRI'06 Proceedings of the 7th international conference on Cellular Automata for Research and Industry
Non-uniform cellular automata: Classes, dynamics, and decidability

Information and Computation
Computational complexity of rule distributions of non-uniform cellular automata

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Chaotic Subshifts and Related Languages Applications to one-dimensional Cellular Automata

Fundamenta Informaticae - Cellular Automata
From One-dimensional to Two-dimensional Cellular Automata

Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Local rule distributions, language complexity and non-uniform cellular automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work studies some aspects of the computational power of fully asynchronous cellular automata ACA. We deal with some notions of simulation between ACA and Turing Machines. In particular, we characterize the updating sequences specifying which are “universal”, i.e., allowing a specific family of ACA to simulate any Turing machine on any input. We also consider the computational cost of such simulations. Finally, we deal with ACA equipped with peculiar updating sequences, namely those generated by random walks.