Fractal dimension of assemblies in the abstract tile assembly model
DOI10.1007/978-3-030-87993-8_8OpenAlexW3206730962MaRDI QIDQ2152091FDOQ2152091
Authors: 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
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
- Strict self-assembly of discrete Sierpinski triangles
- Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM
- The program-size complexity of self-assembled squares (extended abstract)
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
- On the Computational Complexity of Algorithms
- Computability and complexity in self-assembly
- Complexity of Self‐Assembled Shapes
- Self-assembly of decidable sets
- Self-assembly of discrete self-similar fractals
- Scaled pier fractals do not strictly self-assemble
- Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
- Scaled Tree Fractals Do not Strictly Self-assemble
- Strict self-assembly of fractals using multiple hands
- Self-assembly of the discrete Sierpinski carpet and related fractals
- Self-assembling rulers for approximating generalized Sierpinski carpets
- Mathematical Foundations of Computer Science 2005
- Self-assembly of infinite structures: a survey
- Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals
- Hierarchical Self-Assembly of Fractals with Signal-Passing Tiles
This page was built for publication: Fractal dimension of assemblies in the abstract tile assembly model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2152091)
