Majority adder implementation by competing patterns in life-like rule B2/S2345

Authors:
Genaro J. Martínez;Kenichi Morita;Andrew Adamatzky;Maurice Margenstern
Affiliations:
Instituto de Ciencias Nucleares and Centro de Ciencias de la Complejidad, Universidad Nacional Autónoma de México, México, DF and Bristol Institute of Technology, University of the ...;Hiroshima University, Higashi, Hiroshima, Japan;Bristol Institute of Technology, University of the West of England, Bristol, United Kingdom;Laboratoire d'Informatique Théorique et Appliquée, Université de Metz, Metz Cedex, France
Venue:
UC'10 Proceedings of the 9th international conference on Unconventional computation
Year:
2010

Citing 11
Cited 0

A computation-universal two-dimensional 8-state triangular reversible cellular automaton

Theoretical Computer Science - Special issue on universal machines and computations
Ultimate Computing: Biomolecular Consciouness and Nano Technology

Ultimate Computing: Biomolecular Consciouness and Nano Technology
Collision-based computing

Collision-based computing
Implementation of logical functions in the game of life

Collision-based computing
Turing universality of the game of life

Collision-based computing
Reaction-Diffusion Computers

Reaction-Diffusion Computers
Computation: finite and infinite machines

Computation: finite and infinite machines
Cellular Automata

Cellular Automata
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
Occurrence of Gliders in an Infinite Class of Life-Like Cellular Automata

ACRI '08 Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry
Game of Life Cellular Automata

Game of Life Cellular Automata

Quantified Score

Hi-index	0.00

Visualization

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.