Computing with virtual cellular automata collider

We present computer models of nano-scale computing circuits based on propagation of localised excitations or defects in complexes of polymer chain rings. A cyclotron automata are sets of rings of one-dimensional array of finite states (cellular automata) which exhibits a wide range of travelling localisations (gliders). When information (e.g. values of logical variables) is encoded in the initial positions and velocity vectors of the gliders the cyclotron automata are becoming power abstract machines which execute high-performance computing. The computing is based on collisions between the mobile localisations. We present collisions that emulate basic types of interactions between localisations typical for spatially-extended non-linear media: fusion, particles, elastic collision, and soliton-like collision, all they implement basic computing primitives. Mobile localisations in complex one-dimensional cellular automata are compact sets of non-quiescent patterns translating along evolution space. These non-trivial patterns can be coded as binary strings (regular expressions) or symbols travelling along a one-dimensional ring, interacting with each other and changing their states, or symbolic values, as a result of interactions and computation.