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

From MaRDI portal
Revision as of 10:07, 28 December 2023 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59884888, #quickstatements; #temporary_batch_1703753727431)
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
    6 January 2010
    0 references
    DNA computing
    0 references
    molecular computing
    0 references
    self-assembly
    0 references
    tiling
    0 references
    undecidability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references