A brief history of cellular automata
ACM Computing Surveys (CSUR)
A new kind of science
Evolution of Parallel Cellular Machines: The Cellular Programming Approach
Evolution of Parallel Cellular Machines: The Cellular Programming Approach
Non-uniform cellular automata based associative memory: Evolutionary design and basins of attraction
Information Sciences: an International Journal
Evolving sequential combinations of elementary cellular automata rules
ECAL'05 Proceedings of the 8th European conference on Advances in Artificial Life
Solving the parity problem in one-dimensional cellular automata
Natural Computing: an international journal
Hi-index | 0.01 |
The understanding of how simple predefined computations can be achieved with cellular automata, either through individual rules, or with rules organised in spatial arrangements or in temporal sequences is a key conceptual underpinning in the general notion of emergent computation. In this context, the parity problem for cellular automata is considered here, through which the number of 1-bits in a binary string should be determined to be even or odd. Although it is known that no individual rule can solve this problem, a solution has been presented in the literature that is able to solve it, for any string length, by means of the sequential chaining of elementary cellular automata rules. Drawing on that solution, here we provide others, significantly simplified from the latter, our approach being based upon analyses of the behaviour of the rules used in the original work.