Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem

DOI10.1007/978-3-662-47221-7_15zbMath1432.68288OpenAlexW1197054406MaRDI QIDQ5500623

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

Publication date: 7 August 2015

Published in: Cellular Automata and Discrete Complex Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47221-7_15

zbMATH Keywords

cellular automataemergent computationparity problemmergingrule compositionactive state transitionsmodulo-\(n\) problem

Mathematics Subject Classification ID

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

Related Items (1)

Synchronous solution of the parity problem on cyclic configurations, with elementary cellular automaton rule 150, over a family of directed, non-circulant, regular graphs

This page was built for publication: Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem