A Computation in a Cellular Automaton Collider Rule 110
Cellular Automata and Lattice Gases
2016-09-20 v1 Emerging Technologies
Formal Languages and Automata Theory
Computational Physics
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.
Keywords
Cite
@article{arxiv.1609.05240,
title = {A Computation in a Cellular Automaton Collider Rule 110},
author = {Genaro J. Martinez and Andrew Adamatzky and Harold V. McIntosh},
journal= {arXiv preprint arXiv:1609.05240},
year = {2016}
}
Comments
39 pages, 32 figures, 3 tables