On the complexity of two-dimensional signed majority cellular automata (Q2409572): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2017.07.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2597319246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progresses in the analysis of stochastic 2D cellular automata: a study of asynchronous 2D minority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decreasing energy functions as a tool for studying threshold networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum period of 2-dimensional uniform neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the bootstraping percolation and other problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the majority rule on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bulking II: Classifications of cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Periodic behaviour of generalized threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity and intrinsic universality in cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasilinear cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bulking I: An abstract theory of bulking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four states are enough! / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Local Symmetries and Universality in Cellular Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Handed Tile Assembly Model Is Not Intrinsically Universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic universality in tile self-assembly requires cooperation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar and grid graph reachability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-completeness of Cellular Automaton Rule 110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259107 / rank
 
Normal rank

Latest revision as of 13:44, 14 July 2024

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