English
Related papers

Related papers: Intrinsic Universality in Self-Assembly

200 papers

This short survey of recent work in tile self-assembly discusses the use of simulation to classify and separate the computational and expressive power of self-assembly models. The journey begins with the result that there is a single…

Computational Geometry · Computer Science 2013-09-06 Damien Woods

We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal. This means that there is a single tile assembly system U that, with proper initialization, simulates any tile assembly system T.…

Data Structures and Algorithms · Computer Science 2012-04-10 David Doty , Jack H. Lutz , Matthew J. Patitz , Robert T. Schweller , Scott M. Summers , Damien Woods

We prove a negative result on the power of a model of algorithmic self-assembly for which it has been notoriously difficult to find general techniques and results. Specifically, we prove that Winfree's abstract Tile Assembly Model, when…

Computational Complexity · Computer Science 2013-04-11 Pierre-Étienne Meunier , Matthew J. Patitz , Scott M. Summers , Guillaume Theyssier , Andrew Winslow , Damien Woods

The well-studied Two-Handed Tile Assembly Model (2HAM) is a model of tile assembly in which pairs of large assemblies can bind, or self-assemble, together. In order to bind, two assemblies must have matching glues that can simultaneously…

Computational Geometry · Computer Science 2014-08-22 Erik D. Demaine , Matthew J. Patitz , Trent A. Rogers , Robert T. Schweller , Scott M. Summers , Damien Woods

The field of algorithmic self-assembly is concerned with the computational and expressive power of nanoscale self-assembling molecular systems. In the well-studied cooperative, or temperature 2, abstract tile assembly model it is known that…

Computational Complexity · Computer Science 2017-05-31 Pierre-Étienne Meunier , Damien Woods

Algorithmic self-assembly occurs when disorganized components autonomously combine to form structures and, by their design and the dynamics of the system, are forced to follow the execution of algorithms. Motivated by applications in…

Computational Geometry · Computer Science 2023-05-05 Daniel Hader , Matthew J. Patitz

In this paper, we extend existing results about simulation and intrinsic universality in a model of tile-based self-assembly. Namely, we work within the 2-Handed Assembly Model (2HAM), which is a model of self-assembly in which assemblies…

Computational Geometry · Computer Science 2015-03-17 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

The Tile Automata (TA) model describes self-assembly systems in which monomers can build structures and transition with an adjacent monomer to change their states. This paper shows that seeded TA is a non-committal intrinsically universal…

Cellular Automata and Lattice Gases · Physics 2024-07-17 Tim Gomez , Elise Grizzell , Asher Haun , Ryan Knobel , Tom Peters , Robert Schweller , Tim Wylie

In this paper we explore the power of tile self-assembly models that extend the well-studied abstract Tile Assembly Model (aTAM) by permitting tiles of shapes beyond unit squares. Our main result shows the surprising fact that any aTAM…

Data Structures and Algorithms · Computer Science 2012-12-20 Erik D. Demaine , Martin L. Demaine , Sándor P. Fekete , Matthew J. Patitz , Robert T. Schweller , Andrew Winslow , Damien Woods

As a mathematical model of self-assembling systems, Winfree's abstract Tile Assembly Model (aTAM) is a remarkable platform for studying the behaviors and powers of self-assembling systems. Capable of Turing universal computation, the aTAM…

Computational Geometry · Computer Science 2016-08-11 Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

Computational Complexity · Computer Science 2009-06-19 Matthew J. Patitz , Scott M. Summers

In the abstract Tile Assembly Model, self-assembling systems consisting of tiles of different colors can form structures on which colored patterns are ``painted.'' We explore the complexity, in terms of the numbers of unique tile types…

Emerging Technologies · Computer Science 2024-03-12 Phillip Drake , Matthew J. Patitz , Scott M. Summers , Tyler Tracy

This paper concerns the self-assembly of scaled-up versions of arbitrary finite shapes. We work in the multiple temperature model that was introduced by Aggarwal, Cheng, Goldwasser, Kao, and Schweller (Complexities for Generalized Models of…

Computational Complexity · Computer Science 2009-09-30 Scott M. Summers

The Tile Assembly Model is a Turing universal model that Winfree introduced in order to study the nanoscale self-assembly of complex (typically aperiodic) DNA crystals. Winfree exhibited a self-assembly that tiles the first quadrant of the…

Computational Complexity · Computer Science 2015-05-18 Jack H. Lutz , Brad Shutters

In this paper, we investigate shape-assembling power of a tile-based model of self-assembly called the Signal-Passing Tile Assembly Model (STAM). In this model, the glues that bind tiles together can be turned on and off by the binding…

Formal Languages and Automata Theory · Computer Science 2022-06-09 Andrew Alseth , Daniel Hader , Matthew J. Patitz

Working in a three-dimensional variant of Winfree's abstract Tile Assembly Model, we show that, for an arbitrary finite, connected shape $X \subset \mathbb{Z}^2$, there is a tile set that uniquely self-assembles into a 3D representation of…

Computational Geometry · Computer Science 2015-07-24 David Furcy , Scott M. Summers

We present a series of results related to mathematical models of self-assembling tiles and the impacts that three diverse properties have on their dynamics. We expand upon a series of prior results which showed that (1) the abstract Tile…

Computational Geometry · Computer Science 2019-10-10 Daniel Hader , Aaron Koch , Matthew J. Patitz , Michael Sharp

In this paper, we work in a 2D version of the probabilistic variant of Winfree's abstract Tile Assembly Model defined by Chandran, Gopalkrishnan and Reif (SICOMP 2012) in which attaching tiles are sampled uniformly with replacement. First,…

Data Structures and Algorithms · Computer Science 2024-08-13 David Furcy , Scott M. Summers

In this paper we demonstrate the power of a model of tile self-assembly based on active glues which can dynamically change state. We formulate the Signal-passing Tile Assembly Model (STAM), based on the model of Padilla, Liu, and Seeman to…

In this paper, we investigate the abilities of systems of self-assembling tiles which can each pass a constant number of signals to their immediate neighbors to create replicas of input shapes. Namely, we work within the Signal-passing Tile…

Emerging Technologies · Computer Science 2022-04-05 Andrew Alseth , Jacob Hendricks , Matthew J. Patitz , Trent A. Rogers
‹ Prev 1 2 3 10 Next ›