Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D

DOI10.1016/j.tcs.2021.02.001zbMath1504.68070OpenAlexW2950093990MaRDI QIDQ2034770

David Furcy, Scott M. Summers, Christian Wendlandt

Publication date: 23 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.02.001

zbMATH Keywords

self-assemblytile complexitytile self-assemblyabstract tile-assembly modeltemperature-1thin rectangles

Mathematics Subject Classification ID

Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (2)

Robust real-time computing with chemical reaction networks ⋮ Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
• Limitations of self-assembly at temperature 1
• Approximate self-assembly of the Sierpinski triangle
• Optimal self-assembly of finite shapes at temperature 1 in 3D
• New bounds on the tile complexity of thin rectangles at temperature-1
• The program-size complexity of self-assembled squares (extended abstract)
• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
• The program-size complexity of self-assembled paths
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Intrinsic universality in tile self-assembly requires cooperation
• Complexity of Self‐Assembled Shapes

This page was built for publication: Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D