Pages that link to "Item:Q2409572"
From MaRDI portal
The following pages link to On the complexity of two-dimensional signed majority cellular automata (Q2409572):
Displaying 14 items.
- \(\sigma\)-game, \(\sigma ^{+}\)-game and two-dimensional additive cellular automata (Q672754) (← links)
- Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness (Q1285169) (← links)
- Freezing sandpiles and Boolean threshold networks: equivalence and complexity (Q2020018) (← links)
- Eric Goles (Q2086708) (← links)
- The mirage of universality in cellular automata (Q2086715) (← links)
- Sandpile toppling on Penrose tilings: identity and isotropic dynamics (Q2086724) (← links)
- On the complexity of the stability problem of binary freezing totalistic cellular automata (Q2201794) (← links)
- The complexity of the asynchronous prediction of the majority automata (Q2201796) (← links)
- The complexity of the majority rule on planar graphs (Q2255002) (← links)
- (Q4486976) (← links)
- (Q5010392) (← links)
- Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models (Q5886821) (← links)
- Two-dimensional rotation-symmetric number-conserving cellular automata (Q6087520) (← links)
- The Structure of Configurations in One-Dimensional Majority Cellular Automata: From Cell Stability to Configuration Periodicity (Q6488210) (← links)
