The Tile Assembly Model is Intrinsically Universal

@article{Doty2012TheTA,
  title={The Tile Assembly Model is Intrinsically Universal},
  author={D. Doty and J. Lutz and Matthew J. Patitz and Robert T. Schweller and Scott M. Summers and D. Woods},
  journal={2012 IEEE 53rd Annual Symposium on Foundations of Computer Science},
  year={2012},
  pages={302-310}
}
  • D. Doty, J. Lutz, +3 authors D. Woods
  • Published 2012
  • Computer Science
  • 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science
We prove that the abstract Tile Assembly Model (aTAM) of nanoscale self-assembly is intrinsically universal. This means that there is a single tile assembly system U that, with proper initialization, simulates any tile assembly system T. The simulation is "intrinsic" in the sense that the self-assembly process carried out by U is exactly that carried out by T, with each tile of T represented by an m × m "super tile" of U. Our construction works for the full aTAM at any temperature, and it… Expand

Paper Mentions

Intrinsic Universality in Self-Assembly
  • D. Woods
  • Mathematics, Computer Science
  • Encyclopedia of Algorithms
  • 2016
Universal Simulation of Directed Systems in the Abstract Tile Assembly Model Requires Undirectedness
Intrinsic universality and the computational power of self-assembly
Simulation in Algorithmic Self-assembly
Powers and Behaviors of Directed Self-assembly
The Two-Handed Tile Assembly Model Is Not Intrinsically Universal
Intrinsic universality in tile self-assembly requires cooperation
Active Tile Self-assembly and Simulations of Computational Systems
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 65 REFERENCES
The Tile Complexity of Linear Assemblies
Combinatorial optimization problems in self-assembly
Strong Fault-Tolerance for Self-Assembly with Fuzzy Temperature
Toward reliable algorithmic self-assembly of DNA tiles: a fixed-width cellular automaton pattern.
The program-size complexity of self-assembled squares (extended abstract)
...
1
2
3
4
5
...