A computation in a cellular automaton collider rule 110

Martinez, G., Adamatzky, A. and McIntosh, H. V. (2016) A computation in a cellular automaton collider rule 110. In: Adamatzky, A., ed. (2016) Advances in Unconventional Computing. (1) Theory. Switzerland: Springer, pp. 391-428. ISBN 9783319339238 Available from: http://eprints.uwe.ac.uk/29859

Full text not available from this repository

Publisher's URL: http://dx.doi.org/10.1007/978-3-319-33924-5_15


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.

Item Type:Book Section
Additional Information:International Centre of Unconventional Computing (ICUC), Laboratorio de Ciencias de la Computación (LCCOMP)
Uncontrolled Keywords:cyclic tag system, rule 110, elementary cellular automata, unconventional computing, universal computing, particles, collisions, artificial life, complex systems, cellular automata collider
Faculty/Department:Faculty of Environment and Technology > Department of Computer Science and Creative Technologies
ID Code:29859
Deposited By: Dr G. Martinez
Deposited On:20 Sep 2016 12:55
Last Modified:20 Sep 2016 12:55

Request a change to this item

Document Downloads

Total Document Downloads

More statistics for this item...