Computation by competing patterns in cellular automata, not-majority binary adder implementation (2010)
Digital Artefact
Martinez, G. J. (2010). Computation by competing patterns in cellular automata, not-majority binary adder implementation

This is an example where competing patterns work as computations in cellular automata model. Here a specific initial configuration in Life-like rule B2/S2345 simulate a NOT-MAJORITY binary adder. For full details about this construction see: http://u... Read More about Computation by competing patterns in cellular automata, not-majority binary adder implementation.