Author:
Lutz Jack H.,Lutz Robyn R.
Abstract
AbstractIt is occasionally useful to reason as if something were true, even when we know that it is almost certainly not true. We discuss two instances, one in distributed computing and one in tile self-assembly, and suggest directions for further investigation of this method.
Publisher
Springer Nature Singapore
Reference26 articles.
1. N.C. Seeman, Nucleic acid junctions and lattices. J. Theor. Biol. 99(2), 237–247 (1982)
2. N.C. Seeman, Structural DNA Nanotechnology (Cambridge University Press, 2015)
3. A.S. Tanenbaum, M. Van Steen, Distributed Systems: Principles and Paradigms (Prentice-Hall, 2007)
4. E. Winfree, Algorithmic Self-Assembly of DNA. Ph.D. thesis (California Institute of Technology, 1998)
5. P.W.K. Rothemund, E. Winfree, The program-size complexity of self-assembled squares (extended abstract), in Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, May 21–23, 2000, Portland, OR, USA, eds. by F.F. Yao, E.M. Luks (ACM, 2000), pp. 459–468