Self-assembly of shapes at constant scale using repulsive forces

DOI10.1007/978-3-319-58187-3_7zbMath1486.68075arXiv1608.04791OpenAlexW2517665994MaRDI QIDQ2400951

Austin Luchsinger, Tim Wylie, Robert T. Schweller

Publication date: 31 August 2017

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1608.04791

zbMATH Keywords

Kolmogorov complexityself-assemblyscaled shapes

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other nonclassical models of computation (68Q09)

Related Items

Self-assembly of 4-sided fractals in the two-handed tile assembly model, Covert computation in self-assembled circuits, Unnamed Item, Unnamed Item, Geometric tiles and powers and limitations of geometric hindrance in self-assembly, Unnamed Item

Cites Work

• New geometric algorithms for fully connected staged self-assembly
• Complexity of graph self-assembly in accretive systems and self-destructible systems
• Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
• Step-wise tile assembly with a constant number of tile types
• Negative interactions in irreversible self-assembly
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model
• Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
• Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract)
• The program-size complexity of self-assembled squares (extended abstract)
• Universal Shape Replicators via Self-Assembly with Attractive and Repulsive Forces
• Complexities for Generalized Models of Self-Assembly
• Complexity of Self‐Assembled Shapes
• Fuel Efficient Computation in Passive Self-Assembly