Asynchronous signal passing for tile self-assembly: Fuel efficient computation and efficient assembly of shapes

Jennifer E. Padilla, Matthew J. Patitz, Robert T. Schweller, Nadrian Seeman, Scott M. Summers, Xingsi Zhong

Research output: Contribution to journalArticle

Abstract

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. [24] 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.

Original languageEnglish (US)
Pages (from-to)459-488
Number of pages30
JournalInternational Journal of Foundations of Computer Science
Volume25
Issue number4
DOIs
StatePublished - 2014

Fingerprint

Tile
Self assembly
Glues
Turing machines

Keywords

  • asynchronous behavior
  • Self-assembly
  • Tile Assembly Model
  • universal computation

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Asynchronous signal passing for tile self-assembly : Fuel efficient computation and efficient assembly of shapes. / Padilla, Jennifer E.; Patitz, Matthew J.; Schweller, Robert T.; Seeman, Nadrian; Summers, Scott M.; Zhong, Xingsi.

In: International Journal of Foundations of Computer Science, Vol. 25, No. 4, 2014, p. 459-488.

Research output: Contribution to journalArticle

Padilla, Jennifer E. ; Patitz, Matthew J. ; Schweller, Robert T. ; Seeman, Nadrian ; Summers, Scott M. ; Zhong, Xingsi. / Asynchronous signal passing for tile self-assembly : Fuel efficient computation and efficient assembly of shapes. In: International Journal of Foundations of Computer Science. 2014 ; Vol. 25, No. 4. pp. 459-488.
@article{2b54f10d8f5d4cc8ba5a23f29bb1f893,
title = "Asynchronous signal passing for tile self-assembly: Fuel efficient computation and efficient assembly of shapes",
abstract = "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. [24] 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.",
keywords = "asynchronous behavior, Self-assembly, Tile Assembly Model, universal computation",
author = "Padilla, {Jennifer E.} and Patitz, {Matthew J.} and Schweller, {Robert T.} and Nadrian Seeman and Summers, {Scott M.} and Xingsi Zhong",
year = "2014",
doi = "10.1142/S0129054114400061",
language = "English (US)",
volume = "25",
pages = "459--488",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "4",

}

TY - JOUR

T1 - Asynchronous signal passing for tile self-assembly

T2 - Fuel efficient computation and efficient assembly of shapes

AU - Padilla, Jennifer E.

AU - Patitz, Matthew J.

AU - Schweller, Robert T.

AU - Seeman, Nadrian

AU - Summers, Scott M.

AU - Zhong, Xingsi

PY - 2014

Y1 - 2014

N2 - 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. [24] 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.

AB - 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. [24] 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.

KW - asynchronous behavior

KW - Self-assembly

KW - Tile Assembly Model

KW - universal computation

UR - http://www.scopus.com/inward/record.url?scp=84905994021&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84905994021&partnerID=8YFLogxK

U2 - 10.1142/S0129054114400061

DO - 10.1142/S0129054114400061

M3 - Article

AN - SCOPUS:84905994021

VL - 25

SP - 459

EP - 488

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 4

ER -