On the decidability of self-assembly of infinite ribbons

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 530-537

  Adleman, Leonard ^a   Kari, Jarkko ^b   Kari, Lila ^c   Reishus, Lustin ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b University of Iowa   (United States)

^c UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; SELF ASSEMBLY; THEOREM PROVING;

CELLULAR AUTOMATA; INFINITE DIRECTED ZIPPER PROBLEM; INFINITE RIBBONS; TILING PROBLEM; UNLIMITED INFINITE SNAKE PROBLEM;

COMPUTABILITY AND DECIDABILITY;

EID: 0036957873     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (33)

1. H. Abelson, D. Allen, D. Coore, C. Hanson, G. Homsy, T. Knight, R. Nagpal, E. Rauch, G. Sussman and R. Weiss. Amorphous computing. Communications of the ACM 43 (2000). 74-82.
2. L.Adleman. Molecular computation of solutions to combinatorial problems. Science 266(1994), 1021-1024.
3. L. Adleman, Towards a mathematical theory of self-assembly. Technical Report 00-722 (2000), Department of Computer Science, University of Southern California.
4. L.Adleman, Q.Cheng, A.Goel, M.Huang and H.Wasserman. Linear self-assemblies: equilibria, entropy, and convergence rates. Unpublished, 2000.
5. L.Adleman, Q.Cheng, A.Goel, M.Huang, D.Kempe, P.Moisset des Espanes and P.Rothemund. Combinatorial optimization problems in self-assembly. Proc. ACM Symposium on Theory of Computing (STOC) 2002,23-32.
6. L.Adleman, Q.Cheng, A.Goel and M.Huang. Running time and program size for self-assembled squares. Proc. ACM Symposium on Theory of Computing (STOC) 2001, 740-748.
7. R.Berger. The undecidability of the domino problem. Mem.Amer.Math.Soc. 66(1966).
8. M. Dubois et al. Self-assembly of regular hollow icosahedra in salt-free catanionic solutions. Nature, 411(2001), 672-675.
9. M. Gomez-Lopez, J. Preece, and J. Stoddart. The art and science of self-assembling molecular machines. Nanotechnology, Vol. 7, No. 3 (1996), 183-192.
10. D. Gracias, J. Tien, T. Breen, C. Hsu and G. Whitesides, Forming electrical networks in three dimensions by self-assembly. Science 289(2000), 1170-1173.
11. H.D.Ebbinghaus. Domino threads and complexity. In E. Borger, ed. Computation Theory and Logic. Lecture Notes in Computer Science, 270(1987), Springer, 131-142.
12. Y.Etzion. On the solvability of domino snake problems. M.Sc. Thesis. Dept. of Applied Math. and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1991.
13. Y.Etzion-Petruschka, D.Harel, D.Myers. On the solvability of domino snake problems. Theoretical Computer Science, 313(1994), 243-269. (Received July 1992.)
14. D.Hilbert. Über die stetige Abbildung einer Linie auf ein Flächtenstück. Math. Ann. 38(1891), 459-460.
15. J.Kari. Reversibility of 2D cellular automata is undecidable. Physica D, 45(1990), 379-385.
16. J.Kari. Reversibility and surjectivity problems of cellular automata. Journal of Computer and System Sciences, vol.48, no.1(1994), 149-182.
17. D.König. Über eine Schlussweise aus dem Endlichen ins Unendliche. Acta Litt.Sci., Szeged, 3(1927), 121-130.
18. G. Lopinski, D. Wayner and R. Wolkow. Self-directed growth of molecular nano-structures on silicon. Nature 406(2000), 48.
19. C. Mao, T. LaBean, J. Reif and N. Seeman. Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407(2000), 493-496.
20. D.Myers. Decidability of the tiling connectivity problem. Abstract 79T-E42, Notices Amer. Math. Soc., 195(26)(1979), A-441.
21. Lagoudakis and T.LaBean. 2D DNA self-assembly for satisfiability. In DIMACS Series, 54(2000), E. Winfree and D.K. Gifford Eds., DNA-Based Computers V, American Mathematical Society, 141-154.
22. R. Plass, J.A. Last, N.A. Bartelt, G.L. Kellogg. Self-assembled domain patterns. Nature, 412(2001), 875.
23. J. Reif. Local parallel biomolecular computation. In DIMACS Series, 48 (1999), H. Rubin, D.H. Wood Eds., DNA Based Computers III, American Mathematical Society, 217-254.
24. R.M. Robinson. Undecidability and nonperiodicity for tilings of the plane. Inven.Math. 12(1971), 177-209.
25. P. Rothemund. Using lateral capillary forces to compute by self-assembly. Proceedings of the National Academy of Sciences, vol. 9(2000), 984-989.
26. P. Rothemund. Theory and experiments in algorithmic self-assembly, University of Southern California Ph.D. Thesis, 2001.
27. P. Rothemund and E. Winfree. The program-size complexity of self-assembled squares. ACM Symposium on Theory of Computing (STOC) 2001, 459-468.
28. J.H.Schön, H.Meng and Z.Bao. Self-assembled monolayer organic field-effect transistors. Nature, 413(2000), 713-715.
29. H. Wang. Proving theorems by pattern recognition. II. BellSystems Technical Journal, 40(1961), 1-42.
30. E. Winfree, X. Yang and N. Seeman, Universal computation via self-assembly of DNA: Some theory and experiments. In DIMACS Series, 44(1998), L.F.Landweber, E.Baum, eds., DNA Based Computers II, American Mathematical Society, 191-213.
31. E. Winfree, F. Liu, L. Wenzler, N. Seeman. Design and self-assembly of two-dimensional DNA crystals. Nature 394(1998), 539-544.
32. E. Winfree. Algorithmic Self-Assembly of DNA, Ph.D. thesis. California Institute of Technology, Pasadena, 1998.
33. G. Whitesides, J. Mathias and Christopher T. Seto. Molecular self-assembly and nanochemistry: a chemical strategy for the synthesis of nanostructures, Science, 254(1991), 1312-1319.