Self-assembly of Decidable Sets

DOI10.1007/978-3-540-85194-3_17MaRDI QIDQ3543344zbMATH OpenOpenAlexFDO

Authors Scott M. Summers, Matthew J. Patitz

Publication date 2 December 2008

Published in Unconventional Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85194-3_17

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Self-assembly of decidable sets
• Program size and temperature in self-assembly
• Program size and temperature in self-assembly
• Computability and complexity in self-assembly
• Computability and Complexity in Self-assembly

Cites work

• Complexity of Self‐Assembled Shapes
• Computability and Complexity in Self-assembly
• scientific article; zbMATH DE number 3222108 (Why is no real title available?)
• Strict Self-assembly of Discrete Sierpinski Triangles
• The program-size complexity of self-assembled squares (extended abstract)

Cited in

(10)

• scientific article; zbMATH DE number 6905187 (Why is no real title available?)
• Universality in Molecular and Cellular Computing
• Computability and Complexity in Self-assembly
• The undecidability of the infinite ribbon problem: implications for computing by self-assembly
• Computability and complexity in self-assembly
• Self-assembly of decidable sets
• Directed non-cooperative tile assembly is decidable
• Small tile sets that compute while solving mazes
• Limitations of self-assembly at temperature 1
• Self-assembly of infinite structures: a survey

This page was built for publication: Self-assembly of Decidable Sets

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