On the Decidability of Self-Assembly of Infinite Ribbons

  • Authors:

  • Leonard M. Adleman;Jarkko Kari;Lila Kari;Dustin Reishus

  • Affiliations:

  • -;-;-;-

  • Venue:
  • FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
  • Year:
  • 2002

Quantified Score

Hi-index 0.01

Visualization

Abstract

Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical world. A systematic study of self-assembly as a mathematical process has been initiated. The individual components are modelled as square tiles on the infinite two-dimensional plane. Each side of a tile is covered by a specific "glue", and two adjacent tiles will stick if they have matching glues on their abutting edges. Tiles that stick to each other may form various two-dimensional "structures" such as squares, rectangles, or may cover the entire plane. In this paper we focus on a special type of structure, called ribbon: A non-self-crossing sequence of tiles on the plane, in which successive tiles are adjacent along an edge, and abutting edges of consecutive tiles have matching glues. We prove that it is undecidable whether an arbitrary finite set of tiles with glues (infinite supply of each tile type available) can be used to assemble an infinite ribbon. The proof is based on a construction, due to Robinson, of a special set of tiles that allow onlyaperiodic tilings of the plane. This construction is used to create a special set of directed tiles (tiles with arrows painted on the top) with the "strong plane-filling property" - a variation of the "plane-filling property" previously defined by J. Kari. A construction of "sandwich" tiles is then used in conjunction with this special tile set, to reduce the well-known undecidable Tiling Problem to the problem of the existence of an infinite directed zipper (a special kind of ribbon). A "motif" construction is then introduced that allows one tile system to simulate another by using geometry to represent glues. Using motifs, the infinite directed zipper problem is reduced to the infinite ribbon problem, proving the latter undecidable.The result settles an open problemformerly known as the "unlimited infinite snake problem". Moreover, an immediate consequence is the undecidability of the existence of arbitrarily large structures self-assembled using tiles from a given tile set.