Strong Turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs

DOI10.1007/978-3-319-67471-1_7MaRDI QIDQ5227322zbMATH OpenOpenAlexFDO

Authors François Fages, Guillaume le Guludec, Amaury Pouly, 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

zbMATH Keywords

biochemical reaction networksTuring completenessprotein interactioncomputability and complexity

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Systems biology, networks (92C42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Algebraic biochemistry: a framework for analog online computation in cells
• Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
• Rate-independent computation in continuous chemical reaction networks
• Computation with finite stochastic chemical reaction networks
• Composable rate-independent computation in continuous chemical reaction networks

Cited in

(16)

• Programming with ordinary differential equations: some first steps towards a programming language
• Compiling elementary mathematical functions into finite chemical reaction networks via a polynomialization algorithm for ODEs
• An RNA-based theory of natural universal computation
• \textit{CRN}++: molecular programming language
• A Survey on Analog Models of Computation
• Artificial intelligence in biological modelling
• Algebraic biochemistry: a framework for analog online computation in cells
• Stochastic chemical reaction networks for robustly approximating arbitrary probability distributions
• Population-induced phase transitions and the verification of chemical reaction networks
• Robust biomolecular finite automata
• On estimating derivatives of input signals in biochemistry
• Robust real-time computing with chemical reaction networks
• Computing with chemical reaction networks: a tutorial
• On the stability of nucleic acid feedback control systems
• From electric circuits to chemical networks
• On a model of online analog computation in the cell with absolute functional robustness: algebraic characterization, function compiler and error control

This page was built for publication: Strong Turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227322)