Computing in continuous space with self-assembling polygonal tiles (extended abstract)

In this paper we investigate the computational power of the polygonal tile assembly model (polygonal TAM) at temperature 1, i.e. in non-cooperative systems. The polygonal TAM is an extension of Winfree's abstract tile assembly model (aTAM) which not only allows for square tiles (as in the aTAM) but also allows for tile shapes that are polygons. Although a number of self-assembly results have shown computational universality at temperature 1, these are the first results to do so by fundamentally relying on tile placements in continuous, rather than discrete, space. With the square tiles of the aTAM, it is conjectured that the class of temperature 1 systems is not computationally universal. Here we show that the class of systems whose tiles are composed of a regular polygon P with n > 6 sides is computationally universal. On the other hand, we show that the class of systems whose tiles consist of a regular polygon P with n = 3 sides are computationally universal.

[1]  Bin Fu,et al.  Self-assembly with Geometric Tiles , 2011, ICALP.

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

[3]  Matthew J. Patitz,et al.  Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue , 2011, DNA.

[4]  Matthew J. Patitz,et al.  Intrinsic universality in tile self-assembly requires cooperation , 2013, SODA.

[5]  Matthew J. Patitz,et al.  Self-assembly of discrete self-similar fractals , 2009, Natural Computing.

[6]  Erik D. Demaine,et al.  One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile , 2014, ICALP.

[7]  Erik Winfree,et al.  Simple evolution of complex crystal species , 2011, Natural Computing.

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

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

[10]  E. Winfree,et al.  Synthesis of crystals with a programmable kinetic barrier to nucleation , 2007, Proceedings of the National Academy of Sciences.

[11]  Ján Manuch,et al.  Two Lower Bounds for Self-Assemblies at Temperature 1 , 2010, J. Comput. Biol..

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

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

[14]  Constantine G. Evans.  Crystals that Count! Physical Principles and Experimental Investigations of DNA Tile Self-Assembly , 2014 .

[15]  Erik Winfree,et al.  Experimental progress in computation by self-assembly of DNA tilings , 1999, DNA Based Computers.

[16]  Jack H. Lutz,et al.  Computability and Complexity in Self-assembly , 2008, CiE.

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

[18]  Jarkko Kari,et al.  On the decidability of self-assembly of infinite ribbons , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[19]  Sándor P. Fekete,et al.  Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly , 2014, SODA.

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

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

[22]  Lila Kari,et al.  Binary Pattern Tile Set Synthesis Is NP-hard , 2015, ICALP.

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

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

[25]  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.

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

[27]  Yasubumi Sakakibara,et al.  Proceedings of the 16th international conference on DNA computing and molecular programming , 2010 .

[28]  Ján Manuch,et al.  Two Lower Bounds for Self-Assemblies at Temperature 1 , 2009, 2009 3rd International Conference on Bioinformatics and Biomedical Engineering.

[29]  Jack H. Lutz,et al.  The Tile Assembly Model is Intrinsically Universal , 2011, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[30]  J. Reif,et al.  Logical computation using algorithmic self-assembly of DNA triple-crossover molecules , 2000, Nature.

[31]  Lila Kari,et al.  Binary Pattern Tile Set Synthesis Is NP-Hard , 2014, Algorithmica.

[32]  Jacob Hendricks,et al.  The Power of Duples (in Self-Assembly): It's Not So Hip to Be Square , 2014, COCOON.