Fractal dimension of assemblies in the abstract tile assembly model

DOI10.1007/978-3-030-87993-8_8OpenAlexW3206730962MaRDI QIDQ2152091

Daniel Hader, Matthew J. Patitz, Scott M. Summers

Publication date: 6 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-87993-8_8

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Strict self-assembly of fractals using multiple hands
• Self-assembling rulers for approximating generalized Sierpinski carpets
• Computability and complexity in self-assembly
• Self-assembly of decidable sets
• Self-assembly of infinite structures: a survey
• Approximate self-assembly of the Sierpinski triangle
• Self-assembly of discrete self-similar fractals
• Strict self-assembly of discrete Sierpinski triangles
• Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
• Scaled pier fractals do not strictly self-assemble
• Self-assembly of 4-sided fractals in the two-handed tile assembly model
• Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles
• ASYNCHRONOUS SIGNAL PASSING FOR TILE SELF-ASSEMBLY: FUEL EFFICIENT COMPUTATION AND EFFICIENT ASSEMBLY OF SHAPES
• Scaled Tree Fractals Do not Strictly Self-assemble
• The program-size complexity of self-assembled squares (extended abstract)
• Self-assembly of the Discrete Sierpinski Carpet and Related Fractals
• The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
• On the Computational Complexity of Algorithms
• Complexity of Self‐Assembled Shapes
• Mathematical Foundations of Computer Science 2005

This page was built for publication: Fractal dimension of assemblies in the abstract tile assembly model