On the complexity of two-dimensional signed majority cellular automata (Q2409572)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the complexity of two-dimensional signed majority cellular automata
scientific article

    Statements

    On the complexity of two-dimensional signed majority cellular automata (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 October 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cellular automata dynamics
    0 references
    majority cellular automata
    0 references
    signed two-dimensional lattice
    0 references
    Turing universal
    0 references
    intrinsic universal
    0 references
    computational complexity
    0 references
    0 references