Two-state, Reversible, Universal Cellular Automata In Three Dimensions Authors: Daniel B. Miller & Edward Fredkin Carnegie Mellon West Computing Frontiers 2005 Workshop on Reversible Computation. Funding Sources:. Carnegie Mellon University National Science Foundation. Background.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Two-state, Reversible, Universal Cellular Automata In Three DimensionsAuthors: Daniel B. Miller & Edward FredkinCarnegie Mellon WestComputing Frontiers 2005Workshop on Reversible Computation
A and B are swapped if there is an ‘up’ cell in C or D
Gliders can be constructed to move in any of 12 directions
We’ll need this later!
A single strategically placed cell deflects a glider 120 degrees. Combinations of reflectors can route a glider to any of the 12 possible directions.
When two gliders meet, they can interact to produce two new gliders traveling on alternate routes.
This interaction between two gliders is logically equivalent to the Billiard Ball Model (BBM) logic gate. The BBM gate is sufficient for Universal Computation.