A Universal Semi-totalistic Cellular Automaton on Kite and Dart Penrose Tilings

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.

💡 Research Summary

The paper investigates the possibility of universal computation on the aperiodic kite‑and‑dart Penrose tiling using a semi‑totalistic cellular automaton (CA). Unlike regular square or hexagonal lattices, the Penrose tiling is non‑periodic and each tile has a variable number of neighbours (four to seven). This irregularity makes conventional CA designs, which rely on a fixed neighbourhood size, unsuitable. The authors overcome this obstacle by adopting a semi‑totalistic rule set: the next state of a cell depends only on its current state and the count of neighbours in each possible state, not on their exact positions. Consequently, the same transition function can be applied uniformly to any tile regardless of its degree.

To achieve universality, the authors construct a library of “macro‑cells” – finite clusters of tiles that behave as logical components. Macro‑cells are arranged to form wires, signal carriers, and Boolean gates (AND, OR, NOT). Signals travel as a pair of active states that propagate from one macro‑cell to the next, incrementing the count of active neighbours and thereby triggering the same active state in the following macro‑cell. Wires are linear sequences of macro‑cells that guarantee a constant propagation speed. Logical gates are realized by collision‑based interactions: an AND gate produces an output only when two signals arrive simultaneously at a collision site, an OR gate fires when at least one signal arrives, and a NOT gate detects the absence of a signal and generates the opposite state. All these behaviours are encoded solely through the semi‑totalistic transition table, ensuring they work irrespective of the underlying aperiodic geometry.

A further challenge is synchronisation, because the irregular spacing of tiles can cause variable delays. The authors introduce a global “clock wave” that periodically sweeps across the tiling. The clock wave is incorporated into the transition rules so that state changes are permitted only at specific clock phases, effectively aligning the timing of all macro‑cells and eliminating race conditions.

Finally, the paper proves Turing‑completeness by embedding the well‑known one‑dimensional universal CA Rule 110 into the Penrose tiling. Each cell of Rule 110 is simulated by a dedicated macro‑cell, and the semi‑totalistic rule reproduces the exact update behaviour of Rule 110 across the aperiodic substrate. Since Rule 110 is known to be capable of simulating any Turing machine, the constructed CA on the kite‑and‑dart tiling is likewise universal.

The results demonstrate that the lack of translational symmetry does not preclude universal computation; a carefully designed semi‑totalistic CA can harness the local regularities of the Penrose tiling to implement reliable signal propagation and logical operations. This work opens new avenues for studying computation on non‑periodic media, with potential implications for physical implementations in photonic crystals, metamaterials, and other systems where aperiodic order naturally arises.