Computer Science – Computational Complexity
Scientific paper
2009-06-17
EPTCS 1, 2009, pp. 215-225
Computer Science
Computational Complexity
Scientific paper
10.4204/EPTCS.1.21
We review some recent results related to the self-assembly of infinite
structures in the Tile Assembly Model. These results include impossibility
results, as well as novel tile assembly systems in which shapes and patterns
that represent various notions of computation self-assemble. Several open
questions are also presented and motivated.
Patitz Matthew J.
Summers Scott M.
No associations
LandOfFree
Self-Assembly of Infinite Structures 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 Infinite Structures, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-Assembly of Infinite Structures will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-725338