Intrinsic universality in self-assembly

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 275-286

  Doty, David ^a   Lutz, Jack H ^b   Patitz, Matthew J ^b   Summers, Scott M ^b   Woods, Damien ^c  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b Iowa State University   (United States)

^c CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Biomolecular computation; Intrinsic universality; Self assembly

Indexed keywords

SELF ASSEMBLY;

1-SYSTEMS; ASSEMBLY SYSTEMS; BIOMOLECULAR COMPUTATION; CELLULAR AUTOMATONS; INTRINSIC UNIVERSALITIES; TILE ASSEMBLY MODELS;

ASSEMBLY;

EID: 84880281072     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2461     Document Type: Conference Paper

References (26)

1. Leonard Adleman, Qi Cheng, Ashish Goel, and Ming-Deh Huang, Running time and program size for self-assembled squares, STOC '01: Proceedings of the thirty-third annual ACM Symposium on Theory of Computing (New York, NY, USA), ACM, 2001, pp. 740-748.
2. J. Albert and K. Čulik II, A simple universal cellular automaton and its one-way and totalistic version, Complex Systems 1 (1987), no. 1, 1-16.
3. Ho-Lin Chen and Ashish Goel, Error free self-assembly with error prone tiles, Proceedings of the 10th International Meeting on DNA Based Computers, 2004.
4. Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, and Diane L. Souvaine, Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues, Natural Computing 7 (2008), no. 3, 347-370.
5. David Doty, Jack H. Lutz, Matthew J. Patitz, Scott M. Summers, and Damien Woods, Random number selection in self-assembly, Proceedings of The Eighth International Conference on Unconventional Computation (Porta Delgada (Azores), Portugal, September 7-11, 2009), 2009.
6. David Doty, Matthew J. Patitz, and Scott M. Summers, Limitations of self-assembly at temperature 1, Proceedings of The Fifteenth International Meeting on DNA Computing and Molecular Programming (Fayetteville, Arkansas, USA, June 8-11, 2009), 2009, to appear.
7. B. Durand and Zs. Roka, The game of life: universality revisited, Tech. Report 98-01, Laboratoire de l'Informatique du Parallélisme, Ecole Normale Supérieure de Lyon, January 1998.
8. Kenichi Fujibayashi, David Yu Zhang, Erik Winfree, and Satoshi Murata, Error suppression mechanisms for dna tile self-assembly and their simulation, Natural Computing: an international journal 8 (2009), no. 3, 589-612.
9. Gregory Lafitte and Michael Weiss, Universal tilings, STACS (Wolfgang Thomas and Pascal Weil, eds.), Lecture Notes in Computer Science, vol. 4393, Springer, 2007, pp. 367-380.
10. -, Simulations between tilings, Tech. report, University of Athens, 2008.
11. -, An almost totally universal tile set, TAMC (Jianer Chen and S. Barry Cooper, eds.), Lecture Notes in Computer Science, vol. 5532, Springer, 2009, pp. 271-280.
12. James I. Lathrop, Jack H. Lutz, Matthew J. Patitz, and Scott M. Summers, Computability and complexity in self-assembly, Proceedings of The Fourth Conference on Computability in Europe (Athens, Greece, June 15-20, 2008), 2008.
13. Urmi Majumder, Thomas H LaBean, and John H Reif, Activatable tiles for compact error-resilient directional assembly, 13th International Meeting on DNA Computing (DNA 13), Memphis, Tennessee, June 4-8, 2007., 2007.
14. Maurice Margenstern, Cellular automata in hyperbolic spaces, vol. 1: Theory, Old City Publishing, Philadelphia, 2007.
15. Nicolas Ollinger, The intrinsic universality problem of one-dimensional cellular automata, 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS) (H. Alt and M. Habib, eds.), LNCS, vol. 2607, Springer, 2003, pp. 632-641.
16. -, Intrinsically universal cellular automata, Proceedings International Workshop on The Complexity of Simple Programs, Cork, Ireland, 6-7th December 2008 (T. Neary, D. Woods, A.K. Seda, and N. Murphy, eds.), EPTCS, vol. 1, 2009, arXiv:0906.3213v1 [cs.CC], pp. 199-204.
17. Mojzesz Presburger, Uber die vollständigkeit eines gewissen systems der arithmetik ganzer zahlen, welchem die Addition als einzige Operation hervortritt. Compte Rendus du I. Congrks des Mathematiciens des pays Slavs, Warsaw, 1930, pp. 92-101.
18. Paul W. K. Rothemund, Theory and experiments in algorithmic self-assembly, Ph.D. thesis, University of Southern California, December 2001.
19. Paul W. K. Rothemund and Erik Winfree, The program-size complexity of self-assembled squares (extended abstract), STOC '00: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing (New York, NY, USA), ACM, 2000, pp. 459-468.
20. Paul W.K. Rothemund, Nick Papadakis, and Erik Winfree, Algorithmic self-assembly of DNA Sierpinski triangles, PLoS Biology 2 (2004), no. 12, 2041-2053.
21. Nadrian C. Seeman, Nucleic-acid junctions and lattices, Journal of Theoretical Biology 99 (1982), 237-247.
22. David Soloveichik and Erik Winfree, Complexity of compact proofreading for self-assembled patterns, The eleventh International Meeting on DNA Computing, 2005.
23. -, Complexity of self-assembled shapes, SIAM Journal on Computing 36 (2007), no. 6, 1544-1569.
24. Thomas LaBean Urmi Majumder, Sudheer Sahu and John H. Reif, Design and simulation of self-repairing DNA lattices, DNA Computing: DNA12, Lecture Notes in Computer Science, vol. 4287, Springer-Verlag, 2006.
25. Hao Wang, Proving theorems by pattern recognition - II, The Bell System Technical Journal XL (1961), no. 1, 1-41.
26. Erik Winfree, Algorithmic self-assembly of DNA, Ph.D. thesis, California Institute of Technology, June 1998.