Fuel Efficient Computation in Passive Self-Assembly

DOI10.1137/1.9781611973105.109MaRDI QIDQ5741818zbMATH OpenOpenAlexFDO

Authors

Publication date 15 May 2019

Published in Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1208.1565

Mathematics Subject Classification ID

Abstract: In this paper we show that passive self-assembly in the context of the tile self-assembly model is capable of performing fuel efficient, universal computation. The tile self-assembly model is a premiere model of self-assembly in which particles are modeled by four-sided squares with glue types assigned to each tile edge. The assembly process is driven by positive and negative force interactions between glue types, allowing for tile assemblies floating in the plane to combine and break apart over time. We refer to this type of assembly model as passive in that the constituent parts remain unchanged throughout the assembly process regardless of their interactions. A computationally universal system is said to be fuel efficient if the number of tiles used up per computation step is bounded by a constant. Work within this model has shown how fuel guzzling tile systems can perform universal computation with only positive strength glue interactions. Recent work has introduced space-efficient, fuel-guzzling universal computation with the addition of negative glue interactions and the use of a powerful non-diagonal class of glue interactions. Other recent work has shown how to achieve fuel efficient computation within active tile self-assembly. In this paper we utilize negative interactions in the tile self-assembly model to achieve the first computationally universal passive tile self-assembly system that is both space and fuel-efficient. In addition, we achieve this result using a limited diagonal class of glue interactions.

Recommendations

• Parallel computation using active self-assembly
• Parallel Computation Using Active Self-assembly
• Computational self-assembly
• Thermodynamically favorable computation via tile self-assembly
• Dynamic self-assembly in living systems as computation
• Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
• Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes

Cited in

(13)

• Producibility in hierarchical self-assembly
• Parallel computation using active self-assembly
• Exponential replication of patterns in the signal tile assembly model
• An introduction to tile-based self-assembly and a survey of recent results
• Covert computation in self-assembled circuits
• Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
• Strict self-assembly of fractals using multiple hands
• Self-assembly of any shape with constant tile types using high temperature
• Covert computation in self-assembled circuits
• Parallel Computation Using Active Self-assembly
• Dipole codes attractively encode glue functions
• Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes
• Verification and computation in restricted tile automata

This page was built for publication: Fuel Efficient Computation in Passive Self-Assembly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741818)