A computation in a cellular automaton collider rule 110

Martinez, Genaro; Adamatzky, Andrew; McIntosh, Harold V.

Abstract

A cellular automaton collider is a finite state machine build of rings of one-dimensional cellular automata. We show how a computation can be performed on the collider by exploiting interactions between gliders (particles, localisations). The constructions proposed are based on universality of elementary cellular automaton rule 110, cyclic tag systems, supercolliders, and computing on rings.

• Publication Date: Jan 1, 2016
• Deposit Date: Sep 20, 2016
• Peer Reviewed: Peer Reviewed
• Volume: 1
• Pages: 391-428
• Series Title: Emergence, Complexity and Computation
• Series Number: 22
• Book Title: Advances in Unconventional Computing
• ISBN: 9783319339238
• DOI: https://doi.org/10.1007/978-3-319-33924-5_15
• Keywords: cyclic tag system, rule 110, elementary cellular automata, unconventional computing, universal computing, particles, collisions, artificial life, complex systems, cellular automata collider
• Public URL: https://uwe-repository.worktribe.com/output/921178
• Publisher URL: http://dx.doi.org/10.1007/978-3-319-33924-5_15
• Related Public URLs: http://uncomp.uwe.ac.uk/genaro/Papers/Papers_on_CA.html
• Additional Information: Additional Information : International Centre of Unconventional Computing (ICUC), Laboratorio de Ciencias de la Computación (LCCOMP)
• Contract Date: Sep 20, 2016