Strong Turing Completeness of Continuous Chemical Reaction Networks

In this talk, I will present some results on the Turing completeness of continuous chemical reaction networks (CRNs).
We will see the link between these results and recent advances in the theory of analog computability and complexity.
In particular, we will see how CRNs relate to the General Purpose Analog Computer (GPAC), a continuous-time analog model
introduced by Claude Shannon in 1941. The GPAC is a physically feasible model in the sense that it can be implemented
in practice through the use of analog electronics or mechanical devices. I will then discuss the limit of this equivalence
when it comes to biological implementations and highlight the crucial importance of robustness when designing CRNs.