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

DOI10.1016/J.TCS.2021.02.001MaRDI QIDQ2034770zbMATH OpenOpenAlexFDO

Authors 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

abstract tile-assembly modelself-assemblytemperature-1thin rectanglestile complexitytile self-assembly

Mathematics Subject Classification ID

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

Recommendations

• New bounds on the tile complexity of thin rectangles at temperature-1
• Optimal program-size complexity for self-assembly at temperature 1 in 3D
• Optimal program-size complexity for self-assembled squares at temperature 1 in 3D

Cites work

• Complexities for Generalized Models of Self-Assembly
• Complexity of Self‐Assembled Shapes
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• Intrinsic universality in tile self-assembly requires cooperation
• Limitations of self-assembly at temperature 1
• New bounds on the tile complexity of thin rectangles at temperature-1
• Optimal program-size complexity for self-assembled squares at temperature 1 in 3D
• Running time and program size for self-assembled squares
• Temperature 1 self-assembly: deterministic assembly in 3D and probabilistic assembly in 2D
• 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
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(7)

• Robust real-time computing with chemical reaction networks
• New bounds on the tile complexity of thin rectangles at temperature-1
• Limitations of Self-assembly at Temperature One
• Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D
• Improved lower and upper bounds on the tile complexity of uniquely self-assembling a thin rectangle non-cooperatively in 3D
• Limitations of self-assembly at temperature 1
• Strict self-assembly of discrete self-similar fractals in the abstract tile assembly model

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

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