Publication:2003447

DOI10.1007/s11047-015-9513-6zbMath1415.68086arXiv1403.3841OpenAlexW1841366214MaRDI QIDQ2003447

Trent A. Rogers, Matthew J. Patitz, Jacob Hendricks

Publication date: 8 July 2019

Published in: Natural Computing, Unconventional Computation and Natural Computation (Search for Journal in Brave)

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

zbMATH Keywords

self-assemblyTuring universalityintrinsic universalitytile-assembly model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Other nonclassical models of computation (68Q09)

Related Items

Doubles and negatives are positive (in self-assembly) ⋮ Geometric tiles and powers and limitations of geometric hindrance in self-assembly ⋮ The two-handed tile assembly model is not intrinsically universal

Cites Work

• Unnamed Item
• Computability and complexity in self-assembly
• Self-assembly of decidable sets
• Limitations of self-assembly at temperature 1
• Negative interactions in irreversible self-assembly
• Doubles and negatives are positive (in self-assembly)
• Signal transmission across tile assemblies: 3D static tiles simulate active self-assembly by 2D signal-passing 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)
• Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
• Intrinsic universality in tile self-assembly requires cooperation
• Complexity of Self‐Assembled Shapes