Follow Slashdot blog updates by subscribing to our blog RSS feed


Forgot your password?
Math Science

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."
This discussion has been archived. No new comments can be posted.

Universal Turing Machine In Penrose Tile Cellular Automata

Comments Filter:
  • Permutation City (Score:4, Interesting)

    by Shad0w99 ( 807661 ) on Friday August 31, 2012 @03:08PM (#41193407)
    Somehow Greg Egan's book "Permutation City" came to my mind when reading this. With his Autoverse representation on cellular automats.
  • by Anonymous Coward on Friday August 31, 2012 @03:31PM (#41193605)

    No, you can't make a sphere with Penrose tiling. As has already been mentioned, a flat tile can't be used to cover a sphere. But more importantly, there isn't a generalization that will work either. The thing that makes Penrose tiling interesting is that it is aperiodic. No aperiodic pattern can work on a sphere since you necessarily are periodic when you make one complete revolution around any greater circle on a sphere.

No extensible language will be universal. -- T. Cheatham