2012/08/14 by Katsunobu Imai, Takahiro Hatsuda, Victor Poupet +1 · 1 voice
Computer Science · Physics and Astronomy · #cs.FL #cs.CC #nlin.CG
paper · pdf · doi:10.4204/eptcs.90.21
published as EPTCS 90, 2012, pp. 267-278 · In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498
arxiv created 2012/08/14 · arxiv updated 2012/08/15
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.