Forgot your password?
typodupeerror
Math Science

Universal Turing Machine In Penrose Tile Cellular Automata 24

Posted by Unknown Lamer
from the mine-bitcoins-using-xscreensaver dept.
New submitter submeta writes "Katsunobu Imai at Hiroshima University has figured out a way to construct a universal Turing machine using cellular automata in a Penrose tile universe. 'Tiles in the first state act as wires that transmit signals between the logic gates, with the signal itself consisting of either a 'front' or 'back' state. Four other states manage the redirecting of the signal within the logic gates, while the final state is simply an unused background to keep the various states separate.' He was not aware of the recent development of the Penrose glider, so he developed this alternative approach."
This discussion has been archived. No new comments can be posted.

Universal Turing Machine In Penrose Tile Cellular Automata

Comments Filter:

Lisp Users: Due to the holiday next Monday, there will be no garbage collection.

Working...