The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (Q3654379)

From MaRDI portal
Revision as of 02:15, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly
scientific article

    Statements

    The Undecidability of the Infinite Ribbon Problem: Implications for Computing by Self-Assembly (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    DNA computing
    0 references
    molecular computing
    0 references
    self-assembly
    0 references
    tiling
    0 references
    undecidability
    0 references
    0 references
    0 references