Computing Issues of Asynchronous CA

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.
Liste complète des métadonnées
Contributeur : Enrico Formenti <>
Soumis le : samedi 7 mai 2016 - 10:24:23
Dernière modification le : lundi 5 novembre 2018 - 15:48:02




Alberto Dennunzio, Enrico Formenti, Luca Manzoni. Computing Issues of Asynchronous CA. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 2012, 120, pp.165-180. 〈〉. 〈10.3233/FI-2012-755〉. 〈hal-01312565〉



Consultations de la notice