A computation in a cellular automaton collider rule 110
(2016)
Book Chapter
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 constru... Read More about A computation in a cellular automaton collider rule 110.