The 4-way deterministic tiling problem is undecidable (Q1013128): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability and nonperiodicity for tilings of the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nilpotency Problem of One-Dimensional Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic aperiodic tile sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversibility and surjectivity problems of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of cellular automata: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization problems in self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexities for Generalized Models of Self-Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124327 / rank
 
Normal rank

Latest revision as of 12:19, 1 July 2024

scientific article
Language Label Description Also known as
English
The 4-way deterministic tiling problem is undecidable
scientific article

    Statements

    The 4-way deterministic tiling problem is undecidable (English)
    0 references
    0 references
    16 April 2009
    0 references
    deterministic tiles
    0 references
    domino problem
    0 references
    tiling problem
    0 references
    undecidability
    0 references
    Wang tiles
    0 references

    Identifiers