Pages that link to "Item:Q2819132"
From MaRDI portal
The following pages link to Unconventional Computation and Natural Computation (Q2819132):
Displaying 50 items.
- Doubles and negatives are positive (in self-assembly) (Q2003447) (← links)
- Fast arithmetic in algorithmic self-assembly (Q2003452) (← links)
- Size-separable tile self-assembly: a tight bound for temperature-1 mismatch-free systems (Q2003454) (← links)
- Reachability Problems for Continuous Chemical Reaction Networks (Q2819133) (← links)
- An All-Optical Soliton FFT Computational Arrangement in the 3NLSE-Domain (Q2819135) (← links)
- Babbage Meets Zuse: A Minimal Mechanical Computer (Q2819136) (← links)
- Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion (Q2819137) (← links)
- Evolving Carbon Nanotube Reservoir Computers (Q2819138) (← links)
- Global Network Cooperation Catalysed by a Small Prosocial Migrant Clique (Q2819139) (← links)
- Model-Based Computation (Q2819141) (← links)
- In Vitro Implementation of a Stack Data Structure Based on DNA Strand Displacement (Q2819144) (← links)
- Analysis of Boolean Logic Gates Logical Complexity for Use with Spiking Memristor Gates (Q2819146) (← links)
- Language Recognition Power and Succinctness of Affine Automata (Q2819147) (← links)
- Training a Carbon-Nanotube/Liquid Crystal Data Classifier Using Evolutionary Algorithms (Q2819154) (← links)
- Towards Quantitative Verification of Reaction Systems (Q2819155) (← links)
- Traversal Languages Capturing Isomorphism Classes of Sierpiński Gaskets (Q2819156) (← links)
- Discrete DNA Reaction-Diffusion Model for Implementing Simple Cellular Automaton (Q2819159) (← links)
- Universal Totalistic Asynchonous Cellular Automaton and Its Possible Implementation by DNA (Q2819160) (← links)
- Five Nodes Are Sufficient for Hybrid Networks of Evolutionary Processors to Be Computationally Complete (Q2945525) (← links)
- Learning Two-Input Linear and Nonlinear Analog Functions with a Simple Chemical System (Q2945526) (← links)
- Scaled Tree Fractals Do not Strictly Self-assemble (Q2945529) (← links)
- GUBS a Language for Synthetic Biology: Specification and Compilation (Q2945531) (← links)
- Modeling Syntactic Complexity with P Systems: A Preview (Q2945532) (← links)
- Pseudo-inversion on Formal Languages (Q2945533) (← links)
- Producibility in Hierarchical Self-assembly (Q2945534) (← links)
- Unconventional Arithmetic: A System for Computation Using Action Potentials (Q2945536) (← links)
- On DNA-Based Gellular Automata (Q2945537) (← links)
- On String Languages Generated by Sequential Spiking Neural P Systems Based on Maximum Spike Number (Q2945539) (← links)
- Languages Associated with Crystallographic Symmetry (Q2945540) (← links)
- Pattern Formation by Spatially Organized Approximate Majority Reactions (Q2945542) (← links)
- Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements (Q2945544) (← links)
- Universal Computation in the Prisoner’s Dilemma Game (Q2945546) (← links)
- Exact Simulation of One-Dimensional Chaotic Dynamical Systems Using Algebraic Numbers (Q2945547) (← links)
- Quantum, Stochastic, and Pseudo Stochastic Languages with Few States (Q2945548) (← links)
- Phase Transition and Strong Predictability (Q2945549) (← links)
- The Unconventionality of Nature: Biology, from Noise to Functional Randomness (Q2945553) (← links)
- Ultrametric Algorithms and Automata (Q2945554) (← links)
- Realism and Texture: Benchmark Problems for Natural Computation (Q2945556) (← links)
- Quantum Computing Meets the Real World (Q2945557) (← links)
- Computations with Grossone-Based Infinities (Q2945558) (← links)
- Exploring the Effect of Cell Heterogeneity in Wound Healing Using a 3D Multicellular Tissue Growth Model (Q2945560) (← links)
- Asynchronous Spiking Neural P Systems with Structural Plasticity (Q2945561) (← links)
- Expressive Power of Non-deterministic Evolving Recurrent Neural Networks in Terms of Their Attractor Dynamics (Q2945562) (← links)
- Duplications and Pseudo-Duplications (Q2945563) (← links)
- Going Beyond Turing with P Automata: Partial Adult Halting and Regular Observer $$\omega $$-Languages (Q2945564) (← links)
- A Cost/Speed/Reliability Tradeoff to Erasing (Q2945565) (← links)
- Replication of Arbitrary Hole-Free Shapes via Self-assembly with Signal-Passing Tiles (Q2945566) (← links)
- Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points (Q2945569) (← links)
- A Uniform Family of Tissue P Systems with Protein on Cells Solving 3-Coloring in Linear Time (Q2945571) (← links)
- Asynchronous Dynamics of Boolean Automata Double-Cycles (Q2945573) (← links)
