Computing Issues of Asynchronous CA - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2012

Computing Issues of Asynchronous CA

Résumé

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.
Fichier non déposé

Dates et versions

hal-01312565 , version 1 (07-05-2016)

Identifiants

Citer

Alberto Dennunzio, Enrico Formenti, Luca Manzoni. Computing Issues of Asynchronous CA. Fundamenta Informaticae, 2012, 120, pp.165-180. ⟨10.3233/FI-2012-755⟩. ⟨hal-01312565⟩
168 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More