Geometric tiles and powers and limitations of geometric hindrance in self-assembly
From MaRDI portal
Publication:6095490
DOI10.1007/S11047-021-09846-2zbMath1530.68113arXiv1903.05774MaRDI QIDQ6095490
Matthew J. Patitz, Daniel Hader
Publication date: 8 September 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.05774
Cites Work
- Unnamed Item
- Computability and complexity in self-assembly
- Limitations of self-assembly at temperature 1
- Strict self-assembly of discrete Sierpinski triangles
- Negative interactions in irreversible self-assembly
- Doubles and negatives are positive (in self-assembly)
- Geometric tiles and powers and limitations of geometric hindrance in self-assembly
- Self-assembly of shapes at constant scale using repulsive forces
- Self-assembly with Geometric Tiles
- The Power of Duples (in Self-Assembly): It’s Not So Hip to Be Square
- Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
- The program-size complexity of self-assembled squares (extended abstract)
- Complexity of Graph Self-assembly in Accretive Systems and Self-destructible Systems
- Computing in continuous space with self-assembling polygonal tiles (extended abstract)
- The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
- One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile
- Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
- Intrinsic universality in tile self-assembly requires cooperation
- Complexity of Self‐Assembled Shapes
This page was built for publication: Geometric tiles and powers and limitations of geometric hindrance in self-assembly
