Universal Turing Machine In Penrose Tile Cellular Automata 24
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."
Universal Turing Machine In Penrose Tile Cellular Automata More Login
Universal Turing Machine In Penrose Tile Cellular Automata
Related Links Top of the: day, week, month.
Slashdot Top Deals