Self-assembly of decidable sets

The theme of this paper is computation in Winfree’s Abstract Tile Assembly Model (TAM). We first review a simple, well-known tile assembly system (the “wedge construction”) that is capable of universal computation. We then extend the wedge construction to prove the following result: if a set of natural numbers is decidable, then it and its complement’s canonical two-dimensional representation self-assemble. This leads to a novel characterization of decidable sets of natural numbers in terms of self-assembly. Finally, we show that our characterization is robust with respect to various (restrictive) geometrical constraints.

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

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

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

[4]  Matthew J. Patitz,et al.  A Domain-Specific Language for Programming in the Tile Assembly Model , 2009, DNA.

[5]  Erik D. Demaine,et al.  Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues , 2007, DNA.

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

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

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

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

[10]  Hao Wang.  Dominoes and the Aea Case of the Decision Problem , 1990 .

[11]  Qi Cheng.  On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields , 2005, SIAM J. Comput..

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

[13]  Matthew J. Patitz,et al.  Limitations of self-assembly at temperature 1 , 2009, Theor. Comput. Sci..

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

[15]  Jack H. Lutz,et al.  Strict Self-assembly of Discrete Sierpinski Triangles , 2007, CiE.

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

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

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

[19]  Ashish Goel,et al.  Optimal Self-Assembly of Counters at Temperature Two , 2004 .

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

[21]  Jack H. Lutz,et al.  Computability and Complexity in Self-assembly , 2008, Theory of Computing Systems.

[22]  Matthew J. Patitz,et al.  Limitations of Self-Assembly at Temperature One (extended abstract) , 2008, CSP.

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

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

[25]  Erik Winfree,et al.  An information-bearing seed for nucleating algorithmic self-assembly , 2009, Proceedings of the National Academy of Sciences.

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