Computer Science – Computational Complexity
Scientific paper
2009-06-17
EPTCS 1, 2009, pp. 67-69
Computer Science
Computational Complexity
Scientific paper
10.4204/EPTCS.1.6
We prove that if a subset X of the integer Cartesian plane weakly self-assembles at temperature 1 in a deterministic (Winfree) tile assembly system satisfying a natural condition known as *pumpability*, then X is a finite union of doubly periodic sets. This shows that only the most simple of infinite shapes and patterns can be constructed using pumpable temperature 1 tile assembly systems, and gives strong evidence for the thesis that temperature 2 or higher is required to carry out general-purpose computation in a tile assembly system. Finally, we show that general-purpose computation is possible at temperature 1 if negative glue strengths are allowed in the tile assembly model.
Doty David
Patitz Matthew J.
Summers Scott M.
No associations
LandOfFree
Limitations of Self-Assembly at Temperature One (extended abstract) 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 Limitations of Self-Assembly at Temperature One (extended abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Limitations of Self-Assembly at Temperature One (extended abstract) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-223781