[Paper Review] Limitations of Self-Assembly at Temperature 1

David Doty, Matthew J. Patitz+1 more|ArXiv.org|Mar 10, 2009

DNA and Biological Computing9 references8 citations

TL;DR

This paper proves that at temperature 1, directed and pumpable tile assembly systems can only weakly self-assemble sets that are finite unions of semi-doubly periodic patterns—demonstrating a fundamental limitation in computational expressiveness. It further shows that universal computation is possible at temperature 1 if negative glue strengths are allowed, enabling error correction and cooperation through repulsive interactions.

ABSTRACT

We prove that if a set $X \subseteq \Z^2$ weakly self-assembles at temperature 1 in a deterministic tile assembly system satisfying a natural condition known as \emph{pumpability}, then $X$ is a finite union of semi-doubly periodic sets. This shows that only the most simple of infinite shapes and patterns can be constructed using pumpable temperature 1 tile assembly systems, and gives evidence for the thesis that temperature 2 or higher is required to carry out general-purpose computation in a tile assembly system. Finally, we show that general-purpose computation \emph{is} possible at temperature 1 if negative glue strengths are allowed in the tile assembly model.

Motivation & Objective

• . The research aims to understand the computational limits of tile self-assembly at temperature 1.
• It investigates whether complex patterns like the Sierpinski triangle can be weakly self-assembled without temperature 2 cooperation.
• The objective is to identify the class of sets that can be weakly self-assembled at temperature 1 under natural assumptions.
• It explores whether directed, temperature 1 systems are fundamentally limited in their ability to perform general-purpose computation.
• It examines whether negative glue strengths can restore computational universality at temperature 1.

Proposed method

• . The paper introduces the concept of 'pumpability'—a condition ensuring that long paths in assemblies contain repeatable, non-colliding segments.
• It proves that any set weakly self-assembled by a directed, pumpable temperature 1 system must be a finite union of semi-doubly periodic sets.
• The proof uses structural analysis of tile paths and the geometric constraints imposed by non-negative glue strengths at temperature 1.
• It constructs a counterexample showing that not all repeating tile segments are pumpable, justifying the pumpability hypothesis.
• It introduces a construction using negative glue strengths to enable cooperation and error correction at temperature 1.
• It demonstrates that with negative glue strengths, temperature 1 tile systems can simulate single-tape Turing machines, achieving computational universality.

Experimental results

Research questions

• RQ1 . Can complex, non-periodic patterns such as the discrete Sierpinski triangle be weakly self-assembled at temperature 1 without cooperation?
• RQ2 . What class of sets can be weakly self-assembled by directed, temperature 1 tile assembly systems under the pumpability condition?
• RQ3 . Is general-purpose deterministic computation possible at temperature 1 using only non-negative glue strengths?
• RQ4 . Can negative glue strengths restore computational universality at temperature 1?
• RQ5 . Is every directed temperature 1 tile system that produces an infinite assembly necessarily pumpable?

Key findings

• . Any set X ⊆ Z² that weakly self-assembles in a directed, pumpable temperature 1 tile assembly system is a finite union of semi-doubly periodic sets.
• . The pumpability hypothesis ensures that repeating tile segments in long paths can be indefinitely extended without collision, enabling structural analysis.
• . Without pumpability, the class of weakly self-assembled sets may be more complex, but the authors conjecture that pumpability holds for all infinite, directed systems.
• . The paper provides a counterexample where a tile repeats but cannot be pumped due to geometric obstruction, justifying the need for the pumpability assumption.
• . With negative glue strengths, temperature 1 tile systems can simulate any single-tape Turing machine, achieving computational universality.
• . The result implies that temperature 1 tile systems with non-negative glue strengths are fundamentally limited in their computational power, while negative glue strengths restore universality.