Reversibility of 2D cellular automata is undecidable (Q807043): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the domino problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3805906 / 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: Q5333602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Note: The Converse of Moore's Garden-of-Eden Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tesselations with local transformations / 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: Q3802618 / rank
 
Normal rank

Revision as of 16:48, 21 June 2024

scientific article
Language Label Description Also known as
English
Reversibility of 2D cellular automata is undecidable
scientific article

    Statements

    Reversibility of 2D cellular automata is undecidable (English)
    0 references
    0 references
    0 references
    1990
    0 references
    reversible cellular automata
    0 references
    undecidability
    0 references
    cellular automaton
    0 references

    Identifiers