Computer Science – Computational Complexity
Scientific paper
2008-03-12
Computer Science
Computational Complexity
Scientific paper
In this paper, we search for {\it absolute} limitations of the Tile Assembly Model (TAM), along with techniques to work around such limitations. Specifically, we investigate the self-assembly of fractal shapes in the TAM. We prove that no self-similar fractal fully weakly self-assembles at temperature 1, and that certain kinds of self-similar fractals do not strictly self-assemble at any temperature. Additionally, we extend the fiber construction from Lathrop et. al. (2007) to show that any self-similar fractal belonging to a particular class of "nice" self-similar fractals has a fibered version that strictly self-assembles in the TAM.
Patitz Matthew J.
Summers Scott M.
No associations
LandOfFree
Self-Assembly of Discrete Self-Similar Fractals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Self-Assembly of Discrete Self-Similar Fractals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Assembly of Discrete Self-Similar Fractals will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-368909