Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly

DOI10.1007/978-3-319-43994-5_7zbMath1451.68116OpenAlexW2516211320MaRDI QIDQ2835706

Robert T. Schweller, Trent A. Rogers, Andrew Winslow, Scott M. Summers, Matthew J. Patitz

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-43994-5_7

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (6)

Optimal self-assembly of finite shapes at temperature 1 in 3D ⋮ Covert computation in self-assembled circuits ⋮ Unnamed Item ⋮ On the effects of hierarchical self-assembly for reducing program-size complexity ⋮ Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limitations of self-assembly at temperature 1
• An aperiodic hexagonal tile
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Producibility in Hierarchical Self-assembly
• Pattern overlap implies runaway growth in hierarchical tile systems
• Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
• The program-size complexity of self-assembled squares (extended abstract)
• Programmable Control of Nucleation for Algorithmic Self-Assembly
• Running time and program size for self-assembled squares
• Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
• Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
• Complexity of Self‐Assembled Shapes
• The undecidability of the domino problem

This page was built for publication: Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly