Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes
In this paper we demonstrate the power of a model of tile self-assembly based on active glues which can dynamically change state. We formulate the Signal-passing Tile Assembly Model (STAM), based on the model of Padilla, et al. to be asynchronous, allowing any action of turning a glue on or off, attaching a new tile, or breaking apart an assembly to happen in any order. Within this highly generalized model we provide three new solutions to tile self-assembly problems that have been addressed within the abstract Tile Assembly Model and its variants, showing that signal passing tiles allow for substantial improvement across multiple complexity metrics. Our first result utilizes a recursive assembly process to achieve tile-type efficient assembly of linear structures, using provably fewer tile types than what is possible in standard tile assembly models. Our second system of signal-passing tiles simulates any Turing machine with high fuel efficiency by using only a constant number of tiles per computation step. Our third system assembles the discrete Sierpinski triangle, demonstrating that this pattern can be strictly self-assembled within the STAM. This result is of particular interest in that it is known that this pattern cannot self-assemble within a number of well studied tile self-assembly models. Notably, all of our constructions are at temperature 1, further demonstrating that signal-passing confers the power to bypass many restrictions found in standard tile assembly models.
KeywordsTuring Machine Tile Type Universal Turing Machine Tape Head Tile Assembly Model
Unable to display preview. Download preview PDF.
- 2.Winfree, E.: Algorithmic Self-Assembly of DNA. PhD thesis, California Institute of Technology (June 1998)Google Scholar
- 3.Wang, H.: Proving theorems by pattern recognition II. AT&T Bell Labs Tech. J. 40, 1–41 (1961)Google Scholar
- 4.Rothemund, P.W.K., Winfree, E.: The program-size complexity of self-assembled squares (extended abstract). In: STOC 2000: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, Portland, Oregon, United States, pp. 459–468. ACM (2000)Google Scholar
- 11.Cannon, S., Demaine, E.D., Demaine, M.L., Eisenstat, S., Patitz, M.J., Schweller, R., Summers, S.M., Winslow, A.: Two hands are better than one (up to constant factors). Technical Report 1201.1650, Computing Research Repository (2012)Google Scholar
- 12.Chen, H.L., Doty, D.: Parallelism and time in hierarchical self-assembly. In: SODA 2012: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1163–1182. SIAM (2012)Google Scholar
- 14.Adleman, L., Cheng, Q., Goel, A., Huang, M.D., Kempe, D., Moisset de Espanés, P., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 23–32 (2002)Google Scholar
- 15.Cook, M., Fu, Y., Schweller, R.: Temperature 1 self-assembly: Deterministic assembly in 3d and probabilistic assembly in 2d. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (2011)Google Scholar
- 18.Schweller, R., Sherman, M.: Fuel efficient computation in passive self-assembly. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013, New Orleans, Louisiana (to appear, 2013)Google Scholar
- 31.Padilla, J.E., Patitz, M.J., Pena, R., Schweller, R.T., Seeman, N.C., Sheline, R., Summers, S.M., Zhong, X.: Asynchronous signal passing for tile self-assembly: Fuel efficient computation and efficient assembly of shapes. Technical Report 1202.5012, Computing Research Repository (2012)Google Scholar
- 33.Demaine, E.D., Patitz, M.J., Schweller, R.T., Summers, S.M.: Self-Assembly of Arbitrary Shapes Using RNAse Enzymes: Meeting the Kolmogorov Bound with Small Scale Factor (extended abstract). In: Schwentick, T., Dürr, C. (eds.) 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, Dortmund, Germany, March 10-12. LIPIcs, vol. 9, pp. 201–212. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)Google Scholar
- 36.Doty, D.: Personal communication (2012)Google Scholar