Memorias de investigación
Research Publications in journals:
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
Year:2009

Research Areas
  • Artificial intelligence

Information
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.
International
Si
JCR
Si
Title
SIAM JOURNAL ON COMPUTING
ISBN
0097-5397
Impact factor JCR
1,459
Impact info
Volume
38
http://dx.doi.org/10.1137/080723971
Journal number
6
From page
2356
To page
2381
Month
MARZO
Ranking
Participants
  • Participante: DUSTIN REISHUS Department of Computer Science, University of Southern California, 3710 McClintock Ave.,
  • Participante: LEONARD ADLEMAN Department of Computer Science, University of Southern California, 3710 McClintock Ave.,
  • Autor: Petr Sosik . UPM
  • Participante: LILA KARI Department of Computer Science, University of Western Ontario, London, ON, N6A 5B7,
  • Participante: JARKKO KARI Department of Mathematics, University of Turku, Turku FI-20014, Finland

Research Group, Departaments and Institutes related
  • Creador: Grupo de Investigación: Grupo de Inteligencia Artificial (LIA)
  • Departamento: Inteligencia Artificial