2000 character limit reached
A Computation in a Cellular Automaton Collider Rule 110
Published 16 Sep 2016 in nlin.CG, cs.ET, cs.FL, and physics.comp-ph | (1609.05240v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.