Computation by competing patterns in cellular automata, not-majority binary adder implementation

Martinez, Genaro J.

Abstract

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://uncomp.uwe.ac.uk/genaro/Diffusion_Rule/Life_B2-S2345.html

Citation

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

• Digital Artefact Type: Video
• Publication Date: Jun 21, 2010
• Publicly Available Date: Jun 8, 2019
• Keywords: majority adder, competing pattern, cellular automata, unconventional computing
• Public URL: https://uwe-repository.worktribe.com/output/977983
• Publisher URL: http://uncomp.uwe.ac.uk/genaro/Diffusion_Rule/Life_B2-S2345.html
• Related Public URLs: http://uncomp.uwe.ac.uk/
• Additional Information: Corporate Creators : International Unconventional Computing Center, BIT, UWE