The Simulation Powers and Limitations of Hierarchical Self-Assembly Systems

In this paper, we extend existing results about simulation and intrinsic universality in a model of tile-based self-assembly. Namely, we work within the 2-Handed Assembly Model (2HAM), which is a model of self-assembly in which assemblies are formed by square tiles that are allowed to combine, using glues along their edges, individually or as pairs of arbitrarily large assemblies in a hierarchical manner, and we explore the abilities of these systems to simulate each other when the simulating systems have a higher “temperature” parameter, which is a system wide threshold dictating how many glue bonds must be formed between two assemblies to allow them to combine. It has previously been shown that systems with lower temperatures cannot simulate arbitrary systems with higher temperatures, and also that systems at some higher temperatures can simulate those at particular lower temperatures, creating an infinite set of infinite hierarchies of 2HAM systems with strictly increasing simulation power within each hierarchy. These previous results relied on two different definitions of simulation, one (strong simulation) seemingly more restrictive than the other (standard simulation), but which have previously not been proven to be distinct. Here we prove distinctions between them by first fully characterizing the set of pairs of temperatures such that the high temperature systems are intrinsically universal for the lower temperature systems (i.e. one tile set at the higher temperature can simulate any at the lower) using strong simulation. This includes the first impossibility result for simulation downward in temperature. We then show that lower temperature systems which cannot be simulated by higher temperature systems using the strong definition, can in fact be simulated using the standard definition, proving the distinction between the types of simulation.

[1]  Erik D. Demaine,et al.  The Two-Handed Tile Assembly Model is not Intrinsically Universal , 2013, Algorithmica.

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

[3]  Nicolas Ollinger,et al.  Bulking I: An abstract theory of bulking , 2011, Theor. Comput. Sci..

[4]  Jacob Hendricks,et al.  Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing tiles , 2014, Natural Computing.

[5]  Nicolas Ollinger,et al.  Four states are enough! , 2011, Theor. Comput. Sci..

[6]  Pablo Arrighi,et al.  Intrinsically universal n-dimensional quantum cellular automata , 2009, J. Comput. Syst. Sci..

[7]  Nicolas Schabanel,et al.  Intrinsic Simulations between Stochastic Cellular Automata , 2012, AUTOMATA & JAC.

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

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

[10]  Jacob Hendricks,et al.  On the Equivalence of Cellular Automata and the Tile Assembly Model , 2013, MCU.

[11]  Damien Woods Intrinsic universality and the computational power of self-assembly , 2013, MCU.

[12]  Jacob Hendricks,et al.  The Simulation Powers and Limitations of Higher Temperature Hierarchical Self-Assembly Systems , 2017, Fundam. Informaticae.

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

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

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

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

[17]  Jacob Hendricks,et al.  Signal Transmission across Tile Assemblies: 3D Static Tiles Simulate Active Self-assembly by 2D Signal-Passing Tiles , 2013, DNA.

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

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

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

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