A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings
Formal Languages and Automata Theory
2012-08-15 v1 Computational Complexity
Cellular Automata and Lattice Gases
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.
Keywords
Cite
@article{arxiv.1208.2771,
title = {A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings},
author = {Katsunobu Imai and Takahiro Hatsuda and Victor Poupet and Kota Sato},
journal= {arXiv preprint arXiv:1208.2771},
year = {2012}
}
Comments
In Proceedings AUTOMATA&JAC 2012, arXiv:1208.2498