Skip to main content
Book Chapter

A Computation in a Cellular Automaton Collider Rule 110

  • Martínez G
  • Adamatzky A
  • McIntosh H
DOI: 10.1007/978-3-319-33924-5_15
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Martínez, G. J., Adamatzky, A., & McIntosh, H. V. (2017). A Computation in a Cellular Automaton Collider Rule 110 (pp. 391–428). https://doi.org/10.1007/978-3-319-33924-5_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free