Turing Universality of Step-Wise and Stage Assembly at Temperature 1

  • Bahar Behsaz
  • Ján Maňuch
  • Ladislav Stacho
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7433)


In this paper, we investigate the computational power of two variants of Winfree’s abstract Tile Assembly Model [14] at temperature 1: the Stage Tile Assembly Model and the Step-wise Tile Assembly Model. In the Stage Tile Assembly Model, the intermediate assemblies are assembled in several “bins” and they can be mixed in prescribed order and attach together to form more complex structures. The Step-wise Tile Assembly Model is a simplified model of stage assembly in which only one bin is used and assembly happens by attaching tiles one by one to the growing structure.

An interesting and still open question is whether the abstract Tile Assembly Model at temperature 1 is Turing Universal, i.e., it can simulate a Turing machine. It is known that various slight modifications of the model are indeed Turing Universal. Namely, deterministic self-assembly in 3D and probabilistic self-assembly in 2D at temperature 1 [3] and self-assembly model at temperature 1 with a single negative glue [10] are known to be able to simulate a Turing machine. In this paper we show that the Step-wise Tile Assembly Model and the Stage Tile Assembly Model are also Turing Universal at temperature 1.


Turing Machine Assembly Model South Side Tile Type Tile Assembly Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abelson, H., Allen, D., Coore, D., Hanson, C., Homsy, G., Knight Jr., T.F., Nagpal, R., Rauch, E., Sussman, G.J., Weiss, R.: Amorphous computing. Commun. ACM 43(5), 74–82 (2000)CrossRefGoogle Scholar
  2. 2.
    Adleman, L., Cheng, Q., Goel, A., Huang, M.-D., Kempe, D., de Espanés, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 23–32 (2002)Google Scholar
  3. 3.
    Cook, M., Fu, Y., Schweller, R.: Temperature 1 self-assembly: Deterministic assembly in 3D and probabilistic assembly in 2D. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (2011)Google Scholar
  4. 4.
    Demaine, E.D., Demaine, M.L., Fekete, S.P., Ishaque, M., Rafalin, E., Schweller, R.T., Souvaine, D.L.: Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues. In: Garzon, M.H., Yan, H. (eds.) DNA 13. LNCS, vol. 4848, pp. 1–14. Springer, Heidelberg (2008)Google Scholar
  5. 5.
    Doty, D., Patitz, M.J., Summers, S.M.: Limitations of self-assembly at temperature 1. Theor. Comput. Sci. 412(1-2) (January 2011)Google Scholar
  6. 6.
    Gómez-López, M., Preece, J.A., Fraser Stoddart, J.: The art and science of self-assembling molecular machines. Nanotechnology 7(3), 183 (1996)CrossRefGoogle Scholar
  7. 7.
    Lagoudakis, M.G., Labean, T.H.: 2D DNA self-assembly for satisfiability. In: Proceedings of the 5th DIMACS Workshop on DNA Based Computers (1999)Google Scholar
  8. 8.
    Mao, C., Labean, T.H., Reif, J.H., Seeman, N.C.: Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407, 493–496 (2000)CrossRefGoogle Scholar
  9. 9.
    Maňuch, J., Stacho, L., Stoll, C.: Step-wise tile assembly with a constant number of tile types. In: Natural Computing (to appear)Google Scholar
  10. 10.
    Patitz, M.J., Schweller, R.T., Summers, S.M.: Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue. In: Cardelli, L., Shih, W. (eds.) DNA 17 2011. LNCS, vol. 6937, pp. 175–189. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Reif, J.H.: Local parallel biomolecular computing. In: DNA Based Computers III. DIMACS, vol. 48 (1999)Google Scholar
  12. 12.
    Seeman, N.C.: Nucleic-acid junctions and lattices. Journal of Theoretical Biology 1, 237–247 (1982)CrossRefGoogle Scholar
  13. 13.
    Wang, H.: Proving theorems by pattern recognition II. The Bell System Technical Journal XL 1, 1–41 (1961)Google Scholar
  14. 14.
    Winfree, E.: Algorithmic Self-assembly of DNA. PhD thesis, California Institute of Technology (1998)Google Scholar
  15. 15.
    Winfree, E., Yang, X., Seeman, N.C.: Universal computation via self-assembly of dna: Some theory and experiments. In: DNA Based Computers II. DIMACS, vol. 44, pp. 191–213 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Bahar Behsaz
    • 1
  • Ján Maňuch
    • 1
    • 2
  • Ladislav Stacho
    • 1
  1. 1.Department of MathematicsSimon Fraser UniversityBurnabyCanada
  2. 2.Department of Computer ScienceUniversity of British ColumbiaVancouverCanada

Personalised recommendations