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

DOI10.1016/J.INS.2019.04.045MaRDI QIDQ2215009zbMATH OpenOpenAlexWikidataFDO

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

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

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

Recommendations

• scientific article; zbMATH DE number 7339755
• Solving the parity problem in one-dimensional cellular automata
• Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
• An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
• Solving the parity problem with rule 60 in array size of the power of two

Cites work

• scientific article; zbMATH DE number 1818513 (Why is no real title available?)
• Computation of functions on n bits by asynchronous clocking of cellular automata
• Computing modulo-\(n\) by composing cellular automata rules
• Guided tour of asynchronous cellular automata
• Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
• Mining a class of decision problems for one-dimensional cellular automata
• On density determination with cellular automata: results, constructions and directions
• Solving the parity problem in one-dimensional cellular automata
• Theory of cellular automata: a survey

Cited in

(14)

• A tutorial on elementary cellular automata with fully asynchronous updating. General properties and convergence dynamics
• Solving the parity problem in one-dimensional cellular automata
• Asynchronous communicating cellular automata: formalization, robustness and equivalence
• scientific article; zbMATH DE number 4085033 (Why is no real title available?)
• An asynchronous solution to the synchronisation problem for binary one-dimensional cellular automata
• Asynchronous cellular systems that solve the parity problem
• No six-cell neighborhood cellular automaton solves the parity problem
• Solving the parity problem with rule 60 in array size of the power of two
• Improvement of a result on sequencing elementary cellular automata rules for solving the parity problem
• A comprehensive taxonomy of cellular automata
• From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority
• Generalisation of a synchronous solution of the parity problem on cyclic configurations over a non-circulant graph
• Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs
• Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215009)