Where academic tradition
meets the exciting future

You are here: TUCS > PUBLICATIONS > Publication Search > The Undecidability of the Infi...

The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly

Leonard Adleman, Jarkko Kari, Lila Kari, Dustin Reishus, Petr Sosik, The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly. SIAM Journal on Computing 38(6), 2356–2381, 2009.

Abstract:

Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical world. Recent experiments in self-assembly demonstrate its potential for the parallel creation of a large number of nanostructures, including possibly computers. A systematic study of self-assembly as a mathematical process has been initiated by L. Adleman and E. Winfree. The individual components are modeled 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 iff they have matching glues on their abutting edges. Tiles that stick to each other may form various two-dimensional “structures” such as squares and rectangles, or may cover the entire plane. In this paper we focus on a special type of structure, called a ribbon: a non-self-crossing rectilinear 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. While the problem can be proved undecidable using existing techniques if the ribbon is required to start with a given “seed” tile, our result settles the “unseeded” case, an open problem formerly known as the “unlimited infinite snake problem.” The proof is based on a construction, due to R. Robinson, of a special set of tiles that allow only aperiodic 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. An immediate consequence of our result is the undecidability of the existence of arbitrarily large structures self-assembled using tiles from a given tile set.

BibTeX entry:

@ARTICLE{jAdKaKaReSo09a,
  title = {The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly},
  author = {Adleman, Leonard and Kari, Jarkko and Kari, Lila and Reishus, Dustin and Sosik, Petr},
  journal = {SIAM Journal on Computing},
  volume = {38},
  number = {6},
  pages = {2356–2381},
  year = {2009},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 3

Edit publication