Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
From MaRDI portal
Publication:5227322
DOI10.1007/978-3-319-67471-1_7zbMath1416.92070OpenAlexW2737153105MaRDI QIDQ5227322
Amaury Pouly, François Fages, Guillaume le Guludec, Olivier Bournez
Publication date: 25 July 2019
Published in: Computational Methods in Systems Biology (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01519828v3/file/FLBP17cmsb.pdf
Biochemistry, molecular biology (92C40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Systems biology, networks (92C42)
Related Items (16)
Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs ⋮ Robust real-time computing with chemical reaction networks ⋮ Real-time computability of real numbers by chemical reaction networks ⋮ An RNA-based theory of natural universal computation ⋮ On a model of online analog computation in the cell with absolute functional robustness: algebraic characterization, function compiler and error control ⋮ Computing with chemical reaction networks: a tutorial ⋮ From electric circuits to chemical networks ⋮ \textit{CRN}++: molecular programming language ⋮ On estimating derivatives of input signals in biochemistry ⋮ On the stability of nucleic acid feedback control systems ⋮ Unnamed Item ⋮ Stochastic chemical reaction networks for robustly approximating arbitrary probability distributions ⋮ Robust biomolecular finite automata ⋮ Programming with ordinary differential equations: some first steps towards a programming language ⋮ A Survey on Analog Models of Computation ⋮ Algebraic biochemistry: a framework for analog online computation in cells
This page was built for publication: Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
