Robust real-time computing with chemical reaction networks

DOI10.1007/978-3-030-87993-8_3OpenAlexW3210963202MaRDI QIDQ2152084

Willem Fletcher, Dawn A. Nye, Titus H. Klinge, Matthew Rayman, James I. Lathrop

Publication date: 6 July 2022

Full work available at URL: https://arxiv.org/abs/2109.02896

zbMATH Keywords

robustnessreal timechemical reaction networksanalog computing

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum algorithms and complexity in the theory of computing (68Q12) Other nonclassical models of computation (68Q09) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (1)

On a model of online analog computation in the cell with absolute functional robustness: algebraic characterization, function compiler and error control

Cites Work

• Unnamed Item
• Stochastic chemical reaction networks for robustly approximating arbitrary probability distributions
• Self-assembly of and optimal encoding within thin rectangles at temperature-1 in 3D
• Composable computation in discrete chemical reaction networks
• Real-time equivalence of chemical reaction networks and analog computers
• Robust biomolecular finite automata
• Geometric tiles and powers and limitations of geometric hindrance in self-assembly
• Real-time computability of real numbers by chemical reaction networks
• Computing with Large Populations Using Interactions
• Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length
• Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
• On the Computational Complexity of Algorithms
• Theory and Applications of Models of Computation

This page was built for publication: Robust real-time computing with chemical reaction networks