Self-assembly of infinite structures: A survey
Theoretical Computer Science
Theory and applications of DNA codeword design
TPNC'12 Proceedings of the First international conference on Theory and Practice of Natural Computing
| Hi-index | 0.00 |
We prove that if a set X 驴 驴2 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 semi-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 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.