Recurring Dominoes: Making the Highly Undecidable Highly Understandable (Q3313255)

From MaRDI portal
Revision as of 13:33, 4 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Recurring Dominoes: Making the Highly Undecidable Highly Understandable
scientific article

    Statements

    title
    Recurring Dominoes: Making the Highly Undecidable Highly Understandable (English)
    0 references
    author
    David Harel
    0 references
    publication date
    1985
    0 references
    zbMATH Keywords
    program logic
    0 references
    tiling problem
    0 references
    undecidability
    0 references
    recurring domino problems
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q65
    0 references
    03D35
    0 references
    05B45
    0 references
    03D15
    0 references
    52C17
    0 references
    zbMATH DE Number
    3843131
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3313255&oldid=16539506"
    Powered by MediaWiki