Remarks on the cellular automaton global synchronisation problem – deterministic vs. stochastic models - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Natural Computing Année : 2019

Remarks on the cellular automaton global synchronisation problem – deterministic vs. stochastic models

Résumé

In the global synchronisation problem, one is asked to find a cellular automaton which has the property that every initial condition evolves into a homogeneous blinking state. We study this simple inverse problem for the case of one-dimensional systems with periodic boundary conditions. Two paradoxical observations are made: (a) despite the apparent simplicity of finding rules with good statistical results, there exist no perfect deterministic solutions to this problem, (b) if we allow the use of randomness in the local rule, constructing ``perfect" stochastic solutions is easy. For the stochastic case, we give some rules for which the mean time of synchronisation varies quadratically with the number of cells and ask if this result can be improved. To explore more deeply the deterministic rules, we code our problem as a SAT problem and USE SAT solvers to find rules that synchronise a large set of initial conditions (in appendix).
Fichier principal
Vignette du fichier
hal-CA-globalSynchProblem-Fates-2018.pdf (515.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01653631 , version 1 (01-12-2017)
hal-01653631 , version 2 (09-04-2018)

Identifiants

Citer

Nazim A. Fatès. Remarks on the cellular automaton global synchronisation problem – deterministic vs. stochastic models. Natural Computing, 2019, 18 (3), pp.429-424. ⟨10.1007/s11047-018-9683-0⟩. ⟨hal-01653631v2⟩
442 Consultations
285 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More