Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly

DOI10.1137/1.9781611973730.12zbMath1371.68084arXiv1408.3351OpenAlexW2950597393MaRDI QIDQ5363027

Robert T. Schweller, Sándor P. Fekete, Trent A. Rogers, Jacob Hendricks, Matthew J. Patitz

Publication date: 5 October 2017

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

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

Mathematics Subject Classification ID

Related Items (16)

A Brief Tour of Theoretical Tile Self-Assembly ⋮ The power of duples (in self-assembly): it's not so hip to be square ⋮ Self-assembly of 4-sided fractals in the two-handed tile assembly model ⋮ Flipping Tiles: Concentration Independent Coin Flips in Tile Self-Assembly ⋮ Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D ⋮ Resiliency to multiple nucleation in temperature-1 self-assembly ⋮ Particle computation: complexity, algorithms, and logic ⋮ Complexity of verification in self-assembly with prebuilt assemblies ⋮ The need for seed (in the abstract Tile Assembly Model) ⋮ On the effects of hierarchical self-assembly for reducing program-size complexity ⋮ Concentration independent random number generation in tile self-assembly ⋮ New geometric algorithms for fully connected staged self-assembly ⋮ Connectivity preserving network transformers ⋮ Geometric tiles and powers and limitations of geometric hindrance in self-assembly ⋮ Reflections on tiles (in self-assembly) ⋮ Resiliency to Multiple Nucleation in Temperature-1 Self-Assembly

This page was built for publication: Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly