The Tile Assembly Model is Intrinsically Universal

We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal. This means that there is a single tile assembly system U that, with proper initialization, simulates any tile assembly system T. The simulation is "intrinsic" in the sense that the self-assembly process carried out by U is exactly that carried out by T, with each tile of T represented by an m × m "super tile" of U. Our construction works for the full aTAM at any temperature, and it faithfully simulates the deterministic or nondeterministic behavior of each T. Our construction succeeds by solving an analog of the cell differentiation problem in developmental biology: Each super tile of U, starting with those in the seed assembly, carries the "genome" of the simulated system T. At each location of a potential super tile in the self-assembly of U, a decision is made whether and how to express this genome, i.e., whether to generate a super tile and, if so, which tile of T it will represent. This decision must be achieved using asynchronous communication under incomplete information, but it achieves the correct global outcome(s).

[1]  Ivan Rapaport,et al.  Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal Time , 2006, FSTTCS.

[2]  Erik Winfree,et al.  Complexity of Self-Assembled Shapes , 2004, SIAM J. Comput..

[3]  Hao Wang,et al.  Proving theorems by pattern recognition I , 1960, Commun. ACM.

[4]  Jehoshua Bruck,et al.  Neural network computation with DNA strand displacement cascades , 2011, Nature.

[5]  E. Winfree,et al.  Toward reliable algorithmic self-assembly of DNA tiles: a fixed-width cellular automaton pattern. , 2008, Nano letters.

[6]  Jack H. Lutz,et al.  Random Number Selection in Self-assembly , 2009, UC.

[7]  E. Winfree,et al.  Algorithmic Self-Assembly of DNA Sierpinski Triangles , 2004, PLoS biology.

[8]  Grégory Lafitte,et al.  Universal Tilings , 2007, STACS.

[9]  Ivan Rapaport,et al.  Erratum to: "Communication Complexity and Intrinsic Universality in Cellular Automata" [Theor. Comput. Sci 412 (1-2) (2011) 2-21] , 2011, Theor. Comput. Sci..

[10]  Ming-Yang Kao,et al.  Complexities for generalized models of self-assembly , 2004, SODA '04.

[11]  Shinnosuke Seki,et al.  Program Size and Temperature in Self-Assembly , 2014, Algorithmica.

[12]  Erik D. Demaine,et al.  Two Hands Are Better Than One (up to constant factors): Self-Assembly In The 2HAM vs. aTAM , 2013, STACS.

[13]  Nicolas Ollinger,et al.  Bulking II: Classifications of cellular automata , 2010, Theor. Comput. Sci..

[14]  John H. Conway,et al.  The game of life. , 1996, The Hastings Center report.

[15]  C. Mao,et al.  Hierarchical self-assembly of DNA into symmetric supramolecular polyhedra , 2008, Nature.

[16]  Lila Kari,et al.  The power of nondeterminism in self-assembly , 2011, SODA '11.

[17]  Nicolas Ollinger,et al.  Intrinsically Universal Cellular Automata , 2009, CSP.

[18]  Erik Winfree,et al.  The program-size complexity of self-assembled squares (extended abstract) , 2000, STOC '00.

[19]  Jack H. Lutz,et al.  Strict self-assembly of discrete Sierpinski triangles , 2007, Theor. Comput. Sci..

[20]  Jarkko Kari,et al.  The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly , 2009, SIAM J. Comput..

[21]  Ming-Yang Kao,et al.  Randomized Self-assembly for Approximate Shapes , 2008, ICALP.

[22]  Robert T. Schweller,et al.  Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D , 2009, SODA '11.

[23]  A. Turberfield,et al.  A DNA-fuelled molecular machine made of DNA , 2022 .

[24]  N. Seeman,et al.  Design and self-assembly of two-dimensional DNA crystals , 1998, Nature.

[25]  Eric Goles Ch.,et al.  Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol , 2008, ISAAC.

[26]  Matthew J. Patitz,et al.  Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[27]  Eric Goles Ch.,et al.  Communication complexity and intrinsic universality in cellular automata , 2011, Theor. Comput. Sci..

[28]  Leonard M. Adleman,et al.  Theory and experiments in algorithmic self-assembly , 2001 .

[29]  Ashish Goel,et al.  Combinatorial optimization problems in self-assembly , 2002, STOC '02.

[30]  B. Durand,et al.  The Game of Life: Universality Revisited , 1999 .

[31]  Erik D. Demaine,et al.  Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues , 2008, Natural Computing.

[32]  Lulu Qian,et al.  Supporting Online Material Materials and Methods Figs. S1 to S6 Tables S1 to S4 References and Notes Scaling up Digital Circuit Computation with Dna Strand Displacement Cascades , 2022 .

[33]  Grégory Lafitte,et al.  An Almost Totally Universal Tile Set , 2009, TAMC.

[34]  John H. Reif,et al.  The Tile Complexity of Linear Assemblies , 2009, ICALP.

[35]  Hao Wang Proving theorems by pattern recognition — II , 1961 .

[36]  Ján Manuch,et al.  Step-Assembly with a Constant Number of Tile Types , 2009, ISAAC.

[37]  Ashish Goel,et al.  Running time and program size for self-assembled squares , 2001, STOC '01.

[38]  M. Fujise,et al.  Pattern reconfigurable leaky-wave antenna design by FDTD method and Floquet's Theorem , 2005, IEEE Transactions on Antennas and Propagation.

[39]  Erik Winfree,et al.  Molecular robots guided by prescriptive landscapes , 2010, Nature.

[40]  Jianer Chen,et al.  Theory and Applications of Models of Computation , 2014, Lecture Notes in Computer Science.

[41]  Erik D. Demaine,et al.  Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract) , 2010, STACS.

[42]  Erik D. Demaine,et al.  Shape replication through self-assembly and RNase enzymes , 2010, SODA '10.

[43]  David Doty,et al.  Randomized Self-Assembly for Exact Shapes , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[44]  Ming-Yang Kao,et al.  Reducing tile complexity for self-assembly through temperature programming , 2006, SODA '06.

[45]  N. Seeman Nucleic acid junctions and lattices. , 1982, Journal of theoretical biology.

[46]  Mildred B. Wohlford Two Hands are Better than One , 1951 .

[47]  Qi Cheng,et al.  Linear Self-Assemblies: Equilibria, Entropy and Convergence Rates , 2003 .

[48]  P. Rothemund Folding DNA to create nanoscale shapes and patterns , 2006, Nature.

[49]  M. Sahani,et al.  Algorithmic Self-Assembly of DNA , 2006 .

[50]  Matthew J. Patitz Simulation of Self-Assembly in the Abstract Tile Assembly Model with ISU TAS , 2011, ArXiv.

[51]  Scott M. Summers Reducing Tile Complexity for the Self-assembly of Scaled Shapes Through Temperature Programming , 2011, Algorithmica.

[52]  Hao Yan,et al.  DNA Origami with Complex Curvatures in Three-Dimensional Space , 2011, Science.