Forgot your password?
typodupeerror
Math

+ - Universal Turing machine in Penrose Tile Cellular Automata-> 1

Submitted by submeta
submeta (2624585) 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."

Link to Original Source
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

Universal Turing machine in Penrose Tile Cellular Automata

Comments Filter:

You will lose an important disk file.

Working...