A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings
Katsunobu Imai, Takahiro Hatsuda, Victor Poupet and 1 more
Electronic Proceedings in Theoretical Computer Science · 2012
doi:10.4204/eptcs.90.21 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In this paper we investigate certain properties of semi-totalistic cellular automata (CA) on the well known quasi-periodic kite and dart two dimensional tiling of the plane presented by Roger Penrose. We show that, despite the irregularity of the underlying grid, it is possible to devise a semi-totalistic CA capable of simulating any boolean circuit on this aperiodic tiling.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.