Advertisement

A Limit to the Power of Multiple Nucleation in Self-assembly

  • Aaron D. Sterling
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5218)

Abstract

Majumder, Reif and Sahu presented in [7] a model of reversible, error-permitting tile self-assembly, and showed that restricted classes of tile assembly systems achieved equilibrium in (expected) polynomial time. One open question they asked was how the model would change if it permitted multiple nucleation, i.e., independent groups of tiles growing before attaching to the original seed assembly. This paper provides a partial answer, by proving that no tile assembly model can use multiple nucleation to achieve speedup from polynomial time to constant time without sacrificing computational power: if a tile assembly system \(\mathcal{T}\) uses multiple nucleation to tile a surface in constant time (independent of the size of the surface), then \(\mathcal{T}\) is unable to solve computational problems that have low complexity in the (single-seeded) Winfree-Rothemund Tile Assembly Model. The proof technique defines a new model of distributed computing that simulates tile assembly, so a tile assembly model can be described as a distributed computing model.

Keywords

self-assembly multiple nucleation locally checkable labeling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adleman, L., Cheng, Q., Goel, A., Huang, M.D.: Running time and program-size for self-assembled squares. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pp. 740–748 (2001)Google Scholar
  2. 2.
    Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics, 2nd edn. Series on Parallel and Distributed Computing. Wiley, Chichester (2004)Google Scholar
  3. 3.
    Aggarwal, G., Goldwasser, M., Kao, M.-Y., Schweller, R.: Complexities for Generalized Models of Self-Assembly. In: Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete Algorithms, pp. 880–889 (2004)Google Scholar
  4. 4.
    Cheng, Q., de Espanes, P.M.: Resolving two open problems in the self-assembly of squares. Technical Report 793, University of Southern California (2003)Google Scholar
  5. 5.
    Lathrop, J., Lutz, J., Patitz, M., Summers, S.: Computability and complexity in self-assembly. In: Logic and Theory of Algorithms: Proceedings of the Fourth Conference on Computability in Europe (to appear, 2008)Google Scholar
  6. 6.
    Lathrop, J., Lutz, J., Summers, S.: Strict self-assembly of discrete Sierpinski triangles. In: Computation and Logic in the Real World: Proceedings of the Third Conference on Computability in Europe, pp. 455–464. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  7. 7.
    Majumder, U., Reif, J., Sahu, S.: Stochastic Analysis of Reversible Self-Assembly. In: Computational and Theoretical Nanoscience (to appear, 2008)Google Scholar
  8. 8.
    Naor, M., Stockmeyer, L.: What can be computed locally? SIAM Journal of Computing 24(6), 1259–1277 (1995)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Patitz, M., Summers, S.: Self-assembly of discrete self-similar fractals. In: Proceedings of the Seventh International Conference on Unconventional Computation, Springer, Heidelberg (to appear, 2008)Google Scholar
  10. 10.
    Rothemund, P.W.K.: Theory and Experiments in Algorithmic Self-Assembly. Ph.D. thesis, University of Southern California, Los Angeles (2001)Google Scholar
  11. 11.
    Rothemund, P., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pp. 459–468 (2000)Google Scholar
  12. 12.
    Seeman, N.: Denovo design of sequences for nucleic-acid structural-engineering. Journal of Biomolecular Structure and Dynamics 8(3), 573–581 (1990)Google Scholar
  13. 13.
    Soloveichik, D., Winfree, E.: Complexity of self-assembled shapes. SIAM Journal of Computing 36(6), 1544–1569 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Wang, H.: Proving theorems by pattern recognition II. Bell Systems Technical Journal 40, 1–41 (1961)Google Scholar
  15. 15.
    Winfree, E.: Algorithmic Self-Assembly of DNA. Ph.D. thesis, California Institute of Technology, Pasadena (1998)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Aaron D. Sterling
    • 1
  1. 1.Department of Computer ScienceIowa State UniversityAmesUSA

Personalised recommendations