Fuel Efficient Computation in Passive Self-Assembly
Robert Schweller, Michael Sherman

TL;DR
This paper demonstrates that passive tile self-assembly can perform universal computation in a fuel and space-efficient manner using negative interactions and limited glue types, advancing the theoretical understanding of self-assembly models.
Contribution
It introduces the first passive tile self-assembly system that is both space and fuel-efficient, utilizing negative interactions and limited glue types for universal computation.
Findings
Achieves universal computation with bounded tiles per step.
Demonstrates space efficiency in passive self-assembly.
Uses negative interactions to enhance fuel efficiency.
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…
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
TopicsModular Robots and Swarm Intelligence · DNA and Biological Computing · Cellular Automata and Applications
