A Computation in a Cellular Automaton Collider Rule 110
Genaro J. Martinez, Andrew Adamatzky, Harold V. McIntosh
TL;DR
This paper demonstrates how to perform computations within a cellular automaton collider using interactions of gliders in rule 110, leveraging its universality and cyclic structures.
Contribution
It introduces a method to compute using cellular automaton colliders by exploiting glider interactions in rule 110, combining universality and ring-based structures.
Findings
Computations can be executed through glider interactions in rule 110.
Cellular automaton colliders can simulate universal computation.
The approach integrates cyclic tag systems and supercolliders.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Stochastic processes and statistical mechanics