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.Comment: 39 pages, 32 figures, 3 table