Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model

DOI10.1007/978-3-319-21999-8_3zbMath1404.68047OpenAlexW1821051139MaRDI QIDQ2948407

Erik Winfree, Nicholas Schiefer

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21999-8_3

Mathematics Subject Classification ID

Classical flows, reactions, etc. in chemistry (92E20) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (7)

Self-assembly of shapes at constant scale using repulsive forces ⋮ Shape formation by programmable particles ⋮ DNAQL: a query language for DNA sticker complexes ⋮ Shape formation by programmable particles ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Time Complexity of Computation and Construction in the Chemical Reaction Network-Controlled Tile Assembly Model

Cites Work

• Unnamed Item
• An introduction to tile-based self-assembly and a survey of recent results
• Deterministic function computation with chemical reaction networks
• Computation with finite stochastic chemical reaction networks
• Negative interactions in irreversible self-assembly
• Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
• Efficient Turing-Universal Computation with DNA Polymers
• Exact Shapes and Turing Universality at Temperature 1 with a Single Negative Glue
• The program-size complexity of self-assembled squares (extended abstract)
• On the Computational Power of Biochemistry
• Running time and program size for self-assembled squares
• Complexities for Generalized Models of Self-Assembly
• Complexity of Self‐Assembled Shapes

This page was built for publication: Universal Computation and Optimal Construction in the Chemical Reaction Network-Controlled Tile Assembly Model