Complexities for generalized models of self-assembly
Gagan Aggarwal,Michael H. Goldwasser,Ming-Yang Kao,Robert T. Schweller +3 more
- pp 880-889
Reads0
Chats0
TLDR
This paper considers whether the tile complexity for self-assembly can be reduced through several natural generalizations of the model, and investigates the problem of verifying whether a given tile system uniquely assembles into a given shape, and shows that this problem is NP-hard.Abstract:
In this paper, we extend Rothemund and Winfree's examination of the tile complexity of tile self-assembly [6]. They provided a lower bound of Ω(log N/log log N) on the tile complexity of assembling an N × N square for almost all N. Adleman et al. [1] gave a construction which achieves this bound. We consider whether the tile complexity for self-assembly can be reduced through several natural generalizations of the model. One of our results is a tile set of size O(√log N) which assembles an N × N square in a model which allows flexible glue strength between non-equal glues (This was independently discovered in [3]). This result is matched by a lower bound dictated by Kolmogorov complexity. For three other generalizations, we show that the Ω(log N/log log N) lower bound applies to N × N squares. At the same time, we demonstrate that there are some other shapes for which these generalizations allow reduced tile sets. Specifically, for thin rectangles with length N and width k, we provide a tighter lower bound of Ω(N(1/k)/k) for the standard model, yet we also give a construction which achieves O(log N/log log N) complexity in a model in which the temperature of the tile system is adjusted during assembly. We also investigate the problem of verifying whether a given tile system uniquely assembles into a given shape, and show that this problem is NP-hard.read more
Citations
More filters
Book ChapterDOI
Multiple Mobile Robot Systems
TL;DR: Within the context of multiple mobile, and networked robot systems, this chapter explores the current state of the art in architectures for multirobot cooperation, exploring the alternative approaches that have been developed.
Journal ArticleDOI
Complexity of Self-Assembled Shapes
David Soloveichik,Erik Winfree +1 more
TL;DR: In this paper, it was shown that the size of the smallest self-assembly program that builds a shape and the shape's descriptional (Kolmogorov) complexity should be related.
Journal ArticleDOI
Two Computational Primitives for Algorithmic Self-Assembly: Copying and Counting
TL;DR: This work has made DNA crystals that copy and crystals that count as they grow, demonstrating the potential of algorithmic self-assembly to create complex nanoscale patterns of technological interest.
Journal ArticleDOI
Modular Robot Systems
Kyle Gilpin,Daniela Rus +1 more
TL;DR: A detailed retrospective on modular robots is presented and connections between modular robots and programmable matter are discussed, using distributed algorithms that use a modules ability to observe its current neighborhood and local rules to decide what to do next.
Journal ArticleDOI
Strict self-assembly of discrete Sierpinski triangles
TL;DR: In this article, it was shown that the standard Sierpinski triangle cannot strictly self-assemble in the Tile Assembly Model, and the fibered Sierpiks can be constructed in the tile model.
References
More filters
Book
An Introduction to Kolmogorov Complexity and Its Applications
Ming Li,Paul M. B. Vitányi +1 more
TL;DR: The Journal of Symbolic Logic as discussed by the authors presents a thorough treatment of the subject with a wide range of illustrative applications such as the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, information theory, computational learning theory, the complexity of algorithms, and the thermodynamics of computing.
Journal ArticleDOI
Proving theorems by pattern recognition — II
TL;DR: Theoretical questions concerning the possibilities of proving theorems by machines are considered in this article from the viewpoint that emphasizes the underlying logic, and a proof procedure for the predicate calculus is given that contains minor peculiar features.
Journal ArticleDOI
DNA double-crossover molecules.
Tsu Ju Fu,Nadrian C. Seeman +1 more
TL;DR: It is concluded that the helices between parallel double crossovers must be shielded from each other or distorted from linearity if they are to participate in recombination and be catalyzed by topoisomerases if it occurs within the cell.
Journal ArticleDOI
Construction, analysis, ligation, and self-assembly of DNA triple crossover complexes
Thomas H. LaBean,Hao Yan,Jens Kopatsch,Furong Liu,Erik Winfree,John H. Reif,Nadrian C. Seeman +6 more
TL;DR: The DNA triple crossover (TX) complex described here extends the set of experimentally characterized building blocks and allows for the presence of reporter strands along the molecular diagonal that can be used to relate the inputs and outputs of DNA-based computation.
Proceedings ArticleDOI
Algorithmic Self-Assembly of DNA
TL;DR: In this paper, the authors focus on molecular self-assembly, giving examples of engineered DNA tiles that crystallize into two-dimensional sheets, one-dimensional tubes and ribbons, and information-guided patterns such as a Sierpinski triangle and a binary counter.