Pages that link to "Item:Q2819132"

The following pages link to Unconventional Computation and Natural Computation (Q2819132):

Displaying 43 items.

• Non-cooperative Algorithms in Self-assembly (Q2945574) (← links)
• Tangle Machines (Q2945575) (← links)
• Formalisation vs. Understanding (Q2945576) (← links)
• Inductive Complexity of P versus NP Problem (Q4648186) (← links)
• Universality and the Halting Problem for Cellular Automata in Hyperbolic Spaces: The Side of the Halting Problem (Q4648187) (← links)
• An Introduction to Tile-Based Self-assembly (Q4648188) (← links)
• Spatial Computing in MGS (Q4648189) (← links)
• P Systems Controlled by General Topologies (Q4648190) (← links)
• P Systems with Minimal Left and Right Insertion and Deletion (Q4648191) (← links)
• Lower Bounds on the Complexity of the Wavelength-Based Machine (Q4648192) (← links)
• String Matching with Involutions (Q4648193) (← links)
• Distributed Execution of Automata Networks on a Computing Medium: Introducing IfAny Machines (Q4648194) (← links)
• Symbol Representations in Evolving Droplet Computers (Q4648197) (← links)
• Inductive Complexity of Goodstein’s Theorem (Q4648198) (← links)
• Towards a Biomolecular Learning Machine (Q4648200) (← links)
• Tractional Motion Machines: Tangent-Managing Planar Mechanisms as Analog Computers and Educational Artifacts (Q4648201) (← links)
• Computing with Sand: On the Complexity of Recognizing Two-dimensional Sandpile Critical Configurations (Q4648202) (← links)
• Genome Parameters as Information to Forecast Emergent Developmental Behaviors (Q4648203) (← links)
• Heterotic Computing Examples with Optics, Bacteria, and Chemicals (Q4648205) (← links)
• Reliable Node Placement in Wireless Sensor Networks Using Cellular Automata (Q4648206) (← links)
• Robust Evaluation of Expressions by Distributed Virtual Machines (Q4648207) (← links)
• Flower Pollination Algorithm for Global Optimization (Q4648208) (← links)
• On the Power of Threshold Measurements as Oracles (Q5300906) (← links)
• Size Lower Bounds for Quantum Automata (Q5300907) (← links)
• Population Protocols on Graphs: A Hierarchy (Q5300908) (← links)
• Spectral Representation of Some Computably Enumerable Sets with an Application to Quantum Provability (Q5300909) (← links)
• On the Power of P Automata (Q5300910) (← links)
• Array Insertion and Deletion P Systems (Q5300911) (← links)
• Boolean Logic Gates from a Single Memristor via Low-Level Sequential Logic (Q5300912) (← links)
• Light Ray Concentration Reduces the Complexity of the Wavelength-Based Machine on PSPACE Languages (Q5300913) (← links)
• Small Steps toward Hypercomputation via Infinitary Machine Proof Verification and Proof Generation (Q5300915) (← links)
• Secure Information Transmission Based on Physical Principles (Q5300916) (← links)
• Hypergraph Automata: A Theoretical Model for Patterned Self-assembly (Q5300917) (← links)
• Modeling Heart Pacemaker Tissue by a Network of Stochastic Oscillatory Cellular Automata (Q5300918) (← links)
• Reaction Systems Made Simple (Q5300919) (← links)
• Voting with a Logarithmic Number of Cards (Q5300921) (← links)
• Asynchronous Signal Passing for Tile Self-assembly: Fuel Efficient Computation and Efficient Assembly of Shapes (Q5300923) (← links)
• Control Languages Associated with Tissue P Systems (Q5300925) (← links)
• Geometric Methods for Analysing Quantum Speed Limits: Time-Dependent Controlled Quantum Systems with Constrained Control Functions (Q5300926) (← links)
• Numerical Analysis of Quantum Speed Limits: Controlled Quantum Spin Chain Systems with Constrained Control Functions (Q5300927) (← links)
• Combinatorial Optimization in Pattern Assembly (Q5300928) (← links)
• On String Reading Stateless Multicounter 5′ → 3′ Watson-Crick Automata (Q5300929) (← links)
• Relating Transition P Systems and Spiking Neural P Systems (Q5300930) (← links)