Computation with competing patterns in Life-like automaton: Binary adder implementation
Genaro J., Martínez, Kenichi, M. , Andrew, A. and Maurice, M. (2010) Computation with competing patterns in Life-like automaton: Binary adder implementation. In: 9th International Conference on Unconventional Computation 2010, Univerisy of Tokyo, Japan, 21st - 25th June , 2010., pp. 93-104
Publisher's URL: http://www.springerlink.com/content/q38873422m4774...
We study Life-like cellular automaton rule B2/S2345. This automaton exhibits a chaotic behaviour 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 life. We design a binary adder of majority gates realised in rule B2/S2345.
Repository Staff Only: item control page
Total Document Downloads in Past 12 Months
Total Document DownloadsMore statistics for this item...