Self-Assembly of Infinite Structures

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent various notions of computation self-assemble. Several open questions are also presented and motivated.

💡 Research Summary

The paper provides a comprehensive survey of recent advances in the self‑assembly of infinite structures within the abstract Tile Assembly Model (TAM). After a brief introduction to TAM’s basic components—tiles, glues, binding strengths, and temperature parameters—the authors motivate the study of infinite assemblies by highlighting their relevance to both theoretical computation (e.g., simulating unbounded Turing‑machine executions) and practical nanofabrication (e.g., constructing arbitrarily large scaffolds). The core of the work is divided into two complementary sections.

The first section establishes several impossibility results that delineate the limits of what can be built with a finite tile set under fixed‑temperature conditions. By employing information‑theoretic arguments, the authors prove lower bounds on the number of distinct tile types required to generate periodic but non‑regular patterns, as well as to realize certain fractal geometries such as the Koch curve. They also show that, without temperature programming, infinite lines or trees cannot be forced to grow beyond a bounded region when the glue strengths are limited, thereby demonstrating a fundamental trade‑off between tile‑set size, glue strength, and achievable infinite complexity.

The second section shifts focus to constructive results, presenting novel tile‑assembly systems that successfully self‑assemble a variety of infinite patterns. Central to this development is the notion of a “computational infinite pattern,” in which each tile encodes both a state of a Turing‑machine‑like controller and the symbol to be output. By arranging tiles so that adjacent glues enforce the correct state transition, the assembly process mirrors the step‑by‑step execution of an infinite computation. Using this framework, the authors design tile sets that generate infinite cellular automaton evolutions, unbounded two‑dimensional lattices with prescribed line patterns, and classic fractals such as the Sierpiński triangle. They formalize the concept of a “simulation‑capable tile set,” proving that for any recursively enumerable infinite language L there exists a tile set whose growth paths correspond exactly to the strings of L.

A further contribution is the introduction of dynamic temperature programming. The authors propose a multi‑phase protocol in which the system starts at a low temperature, allowing only a core set of tiles to bind and form a seed structure. Subsequent temperature increases selectively activate additional tile types, enabling the controlled expansion of the assembly into the desired infinite shape. This approach overcomes the rigidity of fixed‑temperature models and provides a practical mechanism for staged construction of complex infinite objects.

The paper concludes by outlining current challenges and open questions. Key issues include the lack of robust error‑correction schemes for infinite growth (where a single mistake can propagate indefinitely), the difficulty of physically realizing the required temperature schedules at the nanoscale, and the need for experimental platforms capable of fabricating and observing truly infinite assemblies. The authors call for interdisciplinary research that combines theoretical computer science, materials science, and nanofabrication techniques to address these gaps.

Overall, the work significantly expands the theoretical foundations of infinite self‑assembly, offering both negative results that clarify inherent limitations and constructive methods that demonstrate the feasibility of building a wide range of infinite structures. It sets the stage for future exploration of infinite‑scale nanomanufacturing and the embedding of unbounded computation within self‑assembling materials.