Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadata
Contributor : Enrico Formenti <>
Submitted on : Saturday, May 7, 2016 - 10:24:23 AM
Last modification on : Tuesday, December 8, 2020 - 9:40:06 AM




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⟩



Record views