Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue

DOI10.1007/978-3-642-23638-9_15zbMath1348.68055OpenAlexW1512044279MaRDI QIDQ3092340

Scott M. Summers, Robert T. Schweller, Matthew J. Patitz

Publication date: 16 September 2011

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

Full work available at URL: https://doi.org/10.1007/978-3-642-23638-9_15

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (24)

A Brief Tour of Theoretical Tile Self-Assembly ⋮ The power of duples (in self-assembly): it's not so hip to be square ⋮ Self-assembly of shapes at constant scale using repulsive forces ⋮ Self-assembly of 4-sided fractals in the two-handed tile assembly model ⋮ Covert computation in self-assembled circuits ⋮ Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles ⋮ Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model ⋮ Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly ⋮ Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D ⋮ Resiliency to multiple nucleation in temperature-1 self-assembly ⋮ Building squares with optimal state complexity in restricted active self-assembly ⋮ Simplifying the role of signals in tile self-assembly ⋮ Unnamed Item ⋮ Negative interactions in irreversible self-assembly ⋮ On the effects of hierarchical self-assembly for reducing program-size complexity ⋮ Concentration independent random number generation in tile self-assembly ⋮ Dipole codes attractively encode glue functions ⋮ Doubles and negatives are positive (in self-assembly) ⋮ Geometric tiles and powers and limitations of geometric hindrance in self-assembly ⋮ Unnamed Item ⋮ Reflections on tiles (in self-assembly) ⋮ Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly ⋮ Freezing, Bounded-Change and Convergent Cellular Automata ⋮ An introduction to tile-based self-assembly and a survey of recent results

Cites Work

• Unnamed Item
• Limitations of self-assembly at temperature 1
• Strict self-assembly of discrete Sierpinski triangles
• Negative interactions in irreversible self-assembly
• Intrinsic Universality in Self-Assembly
• The program-size complexity of self-assembled squares (extended abstract)
• Randomized Self-assembly for Approximate Shapes
• Reducing tile complexity for self-assembly through temperature programming
• Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
• Polyomino-Safe DNA Self-assembly via Block Replacement
• The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
• Running time and program size for self-assembled squares
• Randomized Self-Assembly for Exact Shapes
• Complexity of Self‐Assembled Shapes

This page was built for publication: Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue