Abstract
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behavior yet capable for purposeful computation. The automaton implements Boolean gates via patterns which compete for the space when propagate in channels. Values of Boolean variables are encoded into two types of patterns - symmetric (False) and asymmetric (True).We construct basic logical gates and elementary arithmetical circuits by simulating logical signals using glider reactions taking place in the channels built of non-destructible still lifes. We design a binary adder of majority gates realised in rule B2/S2345. © Springer-Verlag Berlin Heidelberg 2010.
Cite
CITATION STYLE
Martínez, G. J., Morita, K., Adamatzky, A., & Margenstern, M. (2010). Majority adder implementation by competing patterns in Life-like rule B2/S2345. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6079 LNCS, pp. 93–104). https://doi.org/10.1007/978-3-642-13523-1_12
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
