The program-size complexity of self-assembled paths

DOI10.1145/3357713.3384263OpenAlexW3035715114MaRDI QIDQ5144958

Damien Regnault, Pierre-Étienne Meunier, Damien Woods

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

decidabilitytilingsself-assembly

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D ⋮ Cold dynamics in cellular automata: a tutorial ⋮ Complexity of verification in self-assembly with prebuilt assemblies ⋮ Unique assembly verification in two-handed self-assembly ⋮ Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D

This page was built for publication: The program-size complexity of self-assembled paths