Improvement of a Result on Sequencing Elementary Cellular Automata Rules for Solving the Parity Problem

DOI10.1016/J.ENTCS.2009.09.017zbMath1338.68186OpenAlexW1992398782MaRDI QIDQ2811954

Pedro P. B. de Oliveira, Claudio L. M. Martins

Publication date: 9 June 2016

Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.entcs.2009.09.017

zbMATH Keywords

elementary cellular automataemergent computationparity problemrule-changing cellular automatasequential combination of rulestemporal combination of rules

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80)

Related Items (3)

Solving the parity problem in one-dimensional cellular automata ⋮ 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 perfect solution to the parity problem with elementary cellular automaton 150 under asynchronous update

Cites Work

• Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction
• ONE DIMENSIONAL nARY DENSITY CLASSIFICATION USING TWO CELLULAR AUTOMATON RULES
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improvement of a Result on Sequencing Elementary Cellular Automata Rules for Solving the Parity Problem