Welcome to the Slashdot Beta site -- learn more here. Use the link in the footer or click here to return to the Classic version of Slashdot.

Thank you!

Before you choose to head back to the Classic look of the site, we'd appreciate it if you share your thoughts on the Beta; your feedback is what drives our ongoing development.

Beta is different and we value you taking the time to try it out. Please take a look at the changes we've made in Beta and  learn more about it. Thanks for reading, and for making the site better!

Universal Turing machine in Penrose Tile Cellular Automata

submeta (2624585) writes | more than 2 years ago

Math 1

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

Sorry! There are no comments related to the filter you selected.

Cool (1)

Techmeology (1426095) | more than 2 years ago | (#41181673)

Next up: 4004 in a turing machine in hashlife.
Check for New Comments
Slashdot Login

Need an Account?

Forgot your password?