TL;DR
This paper introduces two minimal tile sets within a maze-based self-assembly model that are capable of universal computation, demonstrating the potential for simplified molecular computing systems.
Contribution
It presents the first known small, universal tile sets in the Maze-Walking Tile Assembly Model, including a 4-tile set for Boolean logic and a 6-tile set inspired by the Collatz function.
Findings
A 4-tile set simulates Boolean circuits with NAND, NXOR, NOT gates.
A 6-tile Collatz set encodes iterative patterns related to the Collatz function.
Both tile sets demonstrate the feasibility of minimal universal self-assembling computational systems.
Abstract
We ask the question of how small a self-assembling set of tiles can be yet have interesting computational behaviour. We study this question in a model where supporting walls are provided as an input structure for tiles to grow along: we call it the Maze-Walking Tile Assembly Model. The model has a number of implementation prospects, one being DNA strands that attach to a DNA origami substrate. Intuitively, the model suggests a separation of signal routing and computation: the input structure (maze) supplies a routing diagram, and the programmer's tile set provides the computational ability. We ask how simple the computational part can be. We give two tiny tile sets that are computationally universal in the Maze-Walking Tile Assembly Model. The first has four tiles and simulates Boolean circuits by directly implementing NAND, NXOR and NOT gates. Our second tile set has 6 tiles and is…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
