2000 character limit reached
A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings
Published 14 Aug 2012 in cs.FL, cs.CC, and nlin.CG | (1208.2771v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
