One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
Preprint
Abstract
In this paper we explore the power of tile self-assembly models that extend the well-studied abstract Tile Assembly Model (aTAM) by permitting tiles of shapes beyond unit squares. Our main result shows the surprising fact that any aTAM system, consisting of many different tile types, can be simulated by a single tile type of a general shape. As a consequence, we obtain a single universal tile type of a single (constant-size) shape that serves as a "universal tile machine": the single universal tile type can simulate any desired aTAM system when given a single seed assembly that encodes the desired aTAM system. We also show how to adapt this result to convert any of a variety of plane tiling systems (such as Wang tiles) into a "nearly" plane tiling system with a single tile (but with small gaps between the tiles). All of these results rely on the ability to both rotate and translate tiles; by contrast, we show that a single nonrotatable tile, of arbitrary shape, can produce assemblies which either grow infinitely or cannot grow at all, implying drastically limited computational power. On the positive side, we show how to simulate arbitrary cellular automata for a limited number of steps using a single nonrotatable tile and a linear-size seed assembly.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Forcing Nonperiodicity with a Single TileThe Mathematical Intelligencer, 2011
- Programmable Control of Nucleation for Algorithmic Self-AssemblySIAM Journal on Computing, 2010
- Synthesis of crystals with a programmable kinetic barrier to nucleationProceedings of the National Academy of Sciences, 2007
- An aperiodic set of 13 Wang tilesDiscrete Mathematics, 1996
- Penrose tilings as coverings of congruent decagonsGeometriae Dedicata, 1996
- Surpassing the information theoretic bound with fusion treesJournal of Computer and System Sciences, 1993
- Undecidability and nonperiodicity for tilings of the planeInventiones Mathematicae, 1971
- Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM
- The undecidability of the domino problemMemoirs of the American Mathematical Society, 1966