Merging Cellular Automata Rules to Optimise a Solution to the Modulo-n Problem
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.
KeywordsCellular automata Emergent computation Rule composition Modulo-n problem Modn problem Merging Active state transitions Parity problem
Unable to display preview. Download preview PDF.
- 1.Martins, C.L.M., de Oliveira, P.P.B.: Computing Modulo-n by Composing Cellular Automata Rules. Under submission to Fundamenta Informaticae (2015)Google Scholar
- 4.Lee, K.M., Xu, H., Chau, H.F.: Parity problem with a cellular automaton solution. Physical Review E 64, 026702/1–026702/4 (2001)Google Scholar
- 6.Wolfram, S.: A New Kind of Science, Wolfram Media (2002)Google Scholar
- 7.Li, W.: Parameterizations of Cellular Automata Rule Space. SFI Technical Report: Preprints, Santa Fe, NM, USA (1991)Google Scholar