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

Abstract : Understanding how the composition of cellular automata rules can perform predefined computations can contribute to the general notion of emerging computing by means of locally processing components. In this context, a solution has been recently proposed to the Modulo-n Problem, which is the determination of whether the number of 1-bits in a binary string is perfectly divisible by the positive integer n. Here, we show how to optimise that solution in terms of a reduction of the number of rules required, by means of a merging operation involving of the rules´ active state transitions. The potential for a more general usage of the merging operation is also addressed.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01442473
Contributor : Hal Ifip <>
Submitted on : Friday, January 20, 2017 - 4:09:19 PM
Last modification on : Monday, January 23, 2017 - 11:41:25 AM
Long-term archiving on : Friday, April 21, 2017 - 3:40:27 PM

File

338243_1_En_15_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Claudio Martins, Pedro Oliveira. Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem. 21st Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2015, Turku, Finland. pp.196-209, ⟨10.1007/978-3-662-47221-7_15⟩. ⟨hal-01442473⟩

Share

Metrics

Record views

70

Files downloads

158