Logical Gates via Gliders Collisions
Cellular Automata and Lattice Gases
2018-03-16 v1 Emerging Technologies
Abstract
An elementary cellular automaton with memory is a chain of finite state machines (cells) updating their state simultaneously and by the same rule. Each cell updates its current state depending on current states of its immediate neighbours and a certain number of its own past states. Some cell-state transition rules support gliders, compact patterns of non-quiescent states translating along the chain. We present designs of logical gates, including reversible Fredkin gate and controlled NOT gate, implemented via collisions between gliders.
Keywords
Cite
@article{arxiv.1803.05496,
title = {Logical Gates via Gliders Collisions},
author = {Genaro J. Martinez and Andrew Adamatzky and Kenichi Morita},
journal= {arXiv preprint arXiv:1803.05496},
year = {2018}
}
Comments
31 pages, 23 figures, 3 tables