A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update

DOI10.1016/j.ins.2019.04.045zbMath1451.68187OpenAlexW2940682283WikidataQ128008470 ScholiaQ128008470MaRDI QIDQ2215009

Pedro P. B. de Oliveira, Eurico L. P. Ruivo

Publication date: 10 December 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.04.045

zbMATH Keywords

cellular automataasynchronyemergent computationparity problemdeterministic update schedules

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (6)

Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs ⋮ A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics ⋮ Asynchronous communicating cellular automata: formalization, robustness and equivalence ⋮ Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates ⋮ An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata ⋮ From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computation of functions on \(n\) bits by asynchronous clocking of cellular automata
• Solving the parity problem in one-dimensional cellular automata
• Theory of cellular automata: a survey
• Improvement of a Result on Sequencing Elementary Cellular Automata Rules for Solving the Parity Problem
• Computing Modulo-n by Composing Cellular Automata Rules

This page was built for publication: A perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update