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

Abstract

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. 1. Introduction. Self-assembly, the process by which objects autonomously come together to form complex structures, is omnipresent in the physical world. Atoms bind to each other by chemical bonds to form molecules, molecules may form crystals or macromolecules, and cells interact to form biological organisms. Recently it has been suggested that complex self-assembly processes will ultimately be used in circuit fabrication, nanorobotics, DNA computation, and amorphous computing. Indeed, in electronics, engineering, medicine, material science, manufacturing, and other disciplines, there is a continuou...

The Tile Assembly Model is Intrinsically Universal

“…We now deal with one-sided binding in the presence of non-contributing input supersides. 5 The first scenario we consider, shown in Figure 4, is one-sided binding where two opposite strength-τ supersides compete to see which should place output supersides. The two input supersides are opposite, and there are no adjacent supersides, therefore both supersides have win-win frames ( Figure 14(2 .1)) and so they both grow probes.…”

On the Equivalence of Cellular Automata and the Tile Assembly Model

“…A TAS T is directed, or produces a unique assembly, if it has exactly one terminal assembly i.e., |A [T ]| = 1. The reader is cautioned that the term "directed" has also been used for a different, more specialized notion in self-assembly [1]. We interpret "directed" to mean "deterministic", though there are multiple senses in which a TAS may be deterministic or nondeterministic.…”

Some considerations on Hydra groups and a new bound for the length of words

“…Minimal automata accepting hairpin (free) languages have been inspected in several papers, see for instance [1,10,11,[18][19][20][21], but, as far as we know, it has always been shown that the best estimation for N (θ,k) is 2 3d k , for non-deterministic automata. Now we will see that it is actually possible to sharpen it in our case.…”

“…We know for example that Adenine and Thymine can link, the same is true for Cytosine and Guanine, but this fails for Adenine and Cytosine or for Thymine and Guanine. Details can be found in [23], but more properly in [1,10,11,[18][19][20][21], where the techniques of the computer science allow to measure the influence that some DNA sequences may have on biological systems.…”

“…Once these elementary rules are satisfied, sophisticated models can be constructed, as show [1,10,11,[18][19][20][21]. We do not give details on this delicate point, referring to the above papers for a rigorous treatment of the topic.…”