A Computation in a Cellular Automaton Collider Rule 110
classification
🌊 nlin.CG
cs.ETcs.FLphysics.comp-ph
keywords
cellularautomatoncollidercomputationringsruleautomatabuild
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.