Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D

DOI10.4230/LIPICS.DNA.27.4MaRDI QIDQ6076672zbMATH OpenFDO

Authors David Furcy, Scott M. Summers, Logan Withers

Publication date 21 September 2023

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

zbMATH Keywords

algorithmic self-assemblyself-assemblytile self-assembly

Mathematics Subject Classification ID

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

Recommendations

• New bounds on the tile complexity of thin rectangles at temperature-1
• Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D
• Complexities for generalized models of self-assembly
• Complexities for Generalized Models of Self-Assembly

Cited in

(5)

• The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation
• Tight bounds on the directed tile complexity of a just-barely 3D \(2 \times N\) rectangle at temperature 1
• Nearly constant tile complexity for any shape in two-handed tile assembly
• Building squares with optimal state complexity in restricted active self-assembly
• Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D

This page was built for publication: Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6076672)