The need for seed (in the abstract Tile Assembly Model)

DOI10.1007/s00453-023-01160-warXiv2211.03877OpenAlexW4385767029MaRDI QIDQ6185943

Unnamed Author, Matthew J. Patitz

Publication date: 9 January 2024

Published in: Algorithmica (Search for Journal in Brave)

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

zbMATH Keywords

simulationalgorithmic self-assemblytile assembly modeltile complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• The two-handed tile assembly model is not intrinsically universal
• Self-assembly of discrete self-similar fractals
• Strict self-assembly of discrete Sierpinski triangles
• The power of duples (in self-assembly): it's not so hip to be square
• On the effects of hierarchical self-assembly for reducing program-size complexity
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Self-assembly with Geometric Tiles
• 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
• 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
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
• Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly
• Intrinsic universality in tile self-assembly requires cooperation
• Randomized Self-Assembly for Exact Shapes
• Complexity of Self‐Assembled Shapes

This page was built for publication: The need for seed (in the abstract Tile Assembly Model)