Asynchronous cellular system that solves the parity problem - Department of Formal methods Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

Asynchronous cellular system that solves the parity problem

Résumé

We present stochastic cellular automata that classify the parity of initial conditions. The model is an interacting particles system where cells are updated by pairs, randomly chosen at each time step. A first rule is proposed, with a symmetry between 0's and 1's. We show that it classifies the parity of the initial configurations thanks to a non-biased random walk of the frontiers between 0's and 1's. We present an analysis of the classification time, as well as numerical simulations, to establish that the classification time scales quadratically with the number of cells. In a second time, breaking the state symmetry, we propose an improvement of this rule with the simultaneous use of two classifying systems.
Fichier principal
Vignette du fichier
Fates-CAparityProblem-ips-2024.pdf (267.29 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03894581 , version 1 (12-12-2022)
hal-03894581 , version 2 (26-06-2024)

Licence

Identifiants

  • HAL Id : hal-03894581 , version 2

Citer

Nazim A. Fatès. Asynchronous cellular system that solves the parity problem. 30th International Workshop on Cellular Automata and Discrete Complex Systems, Jul 2024, Durham (GB), France. ⟨hal-03894581v2⟩
48 Consultations
22 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More