Pages that link to "Item:Q1285169"

The following pages link to Majority-vote cellular automata, Ising dynamics, and \(\mathbf P\)-completeness (Q1285169):

Displaying 22 items.

• Computing with planar toppling domino arrangements (Q256439) (← links)
• The complexity of the bootstraping percolation and other problems (Q393154) (← links)
• Computational complexity of threshold automata networks under different updating schemes (Q475388) (← links)
• PSPACE-completeness of majority automata networks (Q897867) (← links)
• Optical computing (Q1036535) (← links)
• On the computational complexity of the freezing non-strict majority automata (Q1704107) (← links)
• Freezing sandpiles and Boolean threshold networks: equivalence and complexity (Q2020018) (← links)
• Sandpile toppling on Penrose tilings: identity and isotropic dynamics (Q2086724) (← links)
• On the complexity of generalized Q2R automaton (Q2134005) (← links)
• Collective dynamics in heterogeneous networks of neuronal cellular automata (Q2146890) (← links)
• The complexity of the asynchronous prediction of the majority automata (Q2201796) (← links)
• Majority rule cellular automata (Q2232605) (← links)
• The complexity of the majority rule on planar graphs (Q2255002) (← links)
• On the complexity of two-dimensional signed majority cellular automata (Q2409572) (← links)
• Random majority percolation (Q3055887) (← links)
• A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton (Q4571178) (← links)
• (Q5010393) (← links)
• Natural complexity, computational complexity and depth (Q5264347) (← links)
• Color War: Cellular Automata with Majority-Rule (Q5739013) (← links)
• Upper bound on the products of particle interactions in cellular automata (Q5938413) (← links)
• On principles of emergent organization (Q6571624) (← links)
• Intrinsic universality in automata networks. II: Glueing and gadgets (Q6614017) (← links)