Reducing Tile Complexity for Self-Assembly Through Temperature Programming
Ming-Yang Kao, Robert Schweller

TL;DR
This paper introduces a method to reduce tile complexity in self-assembly by dynamically adjusting temperature, enabling efficient encoding of large structures with minimal tile sets and temperature changes.
Contribution
It presents novel techniques for encoding binary numbers via temperature sequences, significantly decreasing tile complexity for assembling large squares.
Findings
Tile complexity reduced from to O(1) for large squares.
A temperature sequence of length O( ) encodes the size of the square.
Both tile complexity and temperature complexity are shown to be optimally balanced.
Abstract
We consider the tile self-assembly model and how tile complexity can be eliminated by permitting the temperature of the self-assembly system to be adjusted throughout the assembly process. To do this, we propose novel techniques for designing tile sets that permit an arbitrary length binary number to be encoded into a sequence of temperature changes such that the tile set uniquely assembles a supertile that precisely encodes the corresponding binary number. As an application, we show how this provides a general tile set of size O(1) that is capable of uniquely assembling essentially any square, where the assembled square is determined by a temperature sequence of length that encodes a binary description of . This yields an important decrease in tile complexity from the required for almost all when the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Modular Robots and Swarm Intelligence · DNA and Biological Computing
