Self-assembly of Decidable Sets

DOI10.1007/978-3-540-85194-3_17zbMath1166.68329OpenAlexW171619333MaRDI QIDQ3543344

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)

Related Items (4)

Universality in Molecular and Cellular Computing ⋮ Limitations of self-assembly at temperature 1 ⋮ Self-assembly of infinite structures: a survey ⋮ Distributed agreement in tile self-assembly

Cites Work

• The program-size complexity of self-assembled squares (extended abstract)
• Computability and Complexity in Self-assembly
• Strict Self-assembly of Discrete Sierpinski Triangles
• Complexity of Self‐Assembled Shapes
• Unnamed Item

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