Resiliency to multiple nucleation in temperature-1 self-assembly

DOI10.1007/978-3-319-43994-5_7MaRDI QIDQ2835706zbMATH OpenOpenAlexFDO

Authors Trent A. Rogers, Robert T. Schweller, Scott M. Summers, Andrew Winslow, 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)

Recommendations

• Exact shapes and Turing universality at temperature 1 with a single negative glue
• Nearly constant tile complexity for any shape in two-handed tile assembly
• Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
• Complexities for high-temperature two-handed tile self-assembly
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal

Cites work

• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• An aperiodic hexagonal tile
• Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
• Complexity of Self‐Assembled Shapes
• Exact shapes and Turing universality at temperature 1 with a single negative glue
• Limitations of self-assembly at temperature 1
• Pattern overlap implies runaway growth in hierarchical tile systems
• Producibility in hierarchical self-assembly
• Programmable control of nucleation for algorithmic self-assembly
• Running time and program size for self-assembled squares
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D
• The program-size complexity of self-assembled squares (extended abstract)
• The undecidability of the domino problem
• Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
• Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly

Cited in

(11)

• Limitations of self-assembly at temperature 1
• Limitations of Self-assembly at Temperature One
• Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
• On the effects of hierarchical self-assembly for reducing program-size complexity
• Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
• Covert computation in self-assembled circuits
• Covert computation in self-assembled circuits
• Resiliency to multiple nucleation in temperature-1 self-assembly
• A Limit to the Power of Multiple Nucleation in Self-assembly
• Concentration independent random number generation in tile self-assembly
• Self-assembly of any shape with constant tile types using high temperature

This page was built for publication: Resiliency to multiple nucleation in temperature-1 self-assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835706)