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

Genaro J., Mart�nez; Kenichi, Morita; Adamatzky, Andrew; Maurice, Margenstern

Abstract

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.

Citation

Genaro J., M., Kenichi, M., Adamatzky, A., & Maurice, M. (2010, June). Computation with competing patterns in Life-like automaton: Binary adder implementation. Presented at 9th International Conference on Unconventional Computation 2010, Univerisy of Tokyo, Japan

• Presentation Conference Type: Speech
• Conference Name: 9th International Conference on Unconventional Computation 2010
• Conference Location: Univerisy of Tokyo, Japan
• Start Date: Jun 21, 2010
• End Date: Jun 25, 2010
• Publication Date: Jun 21, 2010
• Publicly Available Date: Jun 8, 2019
• Peer Reviewed: Peer Reviewed
• Pages: 93-104
• Keywords: unconventional computing, competing patterns, cellular automata, not-majority binary adder
• Public URL: https://uwe-repository.worktribe.com/output/977965
• Publisher URL: http://www.springerlink.com/content/q38873422m4774x4/
• Related Public URLs: http://uncomp.uwe.ac.uk/genaro/Papers/Papers_on_CA.html
• Additional Information: Title of Conference or Conference Proceedings : 9th International Conference on Unconventional Computation 2010; Corporate Creators : International Center of Unconventional Computing