Computation with competing patterns in Life-like automaton: Binary adder implementation

Genaro J., Martínez, Kenichi, M., Adamatzky, A. and Maurice, M. and International Center of Unconventional Computing (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 Available from:

[img] Video (QuickTime) (Computation with competing patterns in Life-like Automaton) - Presentation
Available under License Creative Commons Attribution Non-commercial 3.0.


Publisher's URL:


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.

Item Type:Conference or Workshop Item (Speech)
Uncontrolled Keywords:unconventional computing, competing patterns, cellular automata, not-majority binary adder
Faculty/Department:Faculty of Environment and Technology > Department of Computer Science and Creative Technologies
ID Code:11024
Deposited By: Dr G. Martinez
Deposited On:17 Aug 2010 12:46
Last Modified:10 Oct 2016 11:11

Request a change to this item

Total Document Downloads in Past 12 Months

Document Downloads

Total Document Downloads

More statistics for this item...