Pages that link to "Item:Q3613755"

The following pages link to P-completeness of Cellular Automaton Rule 110 (Q3613755):

Displaying 35 items.

• Rule set design problems for oritatami systems (Q529023) (← links)
• Topological chaos of universal elementary cellular automata rule (Q547228) (← links)
• Bulking II: Classifications of cellular automata (Q549701) (← links)
• Communication complexity and intrinsic universality in cellular automata (Q616488) (← links)
• Four states are enough! (Q616491) (← links)
• Abstract geometrical computation. IV: Small Turing universal signal machines (Q616493) (← links)
• A simple P-complete problem and its language-theoretic representations (Q616494) (← links)
• On the complex behavior of simple tag systems -- an experimental approach (Q616497) (← links)
• Elementary cellular automaton Rule 110 explained as a block substitution system. Rule 110 as a block substitution system (Q985741) (← links)
• The complexity of small universal Turing machines: A survey (Q1004087) (← links)
• Parallel computation using active self-assembly (Q2003467) (← links)
• A one-dimensional physically universal cellular automaton (Q2011676) (← links)
• Freezing sandpiles and Boolean threshold networks: equivalence and complexity (Q2020018) (← links)
• On the complexity of asynchronous freezing cellular automata (Q2051787) (← links)
• The mirage of universality in cellular automata (Q2086715) (← links)
• On fungal automata (Q2086749) (← links)
• Emulating cellular automata in chemical reaction-diffusion networks (Q2311218) (← links)
• On the complexity of two-dimensional signed majority cellular automata (Q2409572) (← links)
• Tag systems and Collatz-like functions (Q2474075) (← links)
• Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy (Q2509952) (← links)
• Unraveling simplicity in elementary cellular automata (Q2628772) (← links)
• The Complexity of Small Universal Turing Machines: A Survey (Q2891384) (← links)
• Universal Sleptsov net (Q3177465) (← links)
• Distributed Multi-authority Attribute-Based Encryption Using Cellular Automata (Q3297637) (← links)
• On the Computational Complexity of Spiking Neural P Systems (Q3543343) (← links)
• Chaos emerged on the ‘edge of chaos’ (Q4903509) (← links)
• (Q5010155) (← links)
• (Q5010393) (← links)
• Average-Case Completeness in Tag Systems (Q5090467) (← links)
• Parallel Computation Using Active Self-assembly (Q5168495) (← links)
• Freezing, Bounded-Change and Convergent Cellular Automata (Q5864724) (← links)
• Communication complexity meets cellular automata: necessary conditions for intrinsic universality (Q6095497) (← links)
• Building squares with optimal state complexity in restricted active self-assembly (Q6133652) (← links)
• Unpredictability and entanglement in open quantum systems (Q6559631) (← links)
• On principles of emergent organization (Q6571624) (← links)