“…Unfortunately, while the above mentioned results are easy to state, their proofs are rather highly technical and mixing considerations about approximations, control of errors, and various constructions to emulate in a continuous fashion some discrete processes. There have been some recent attempts to go to simpler constructions in order to simplify their programming [Bou22], as these constructions have recently lead to solve various open problems, with very visible awarded outcomes: This includes the proof of the existence of a universal ordinary differential equation [BP17], the proof of the Turing completeness of chemical reactions [Fag+17], or hardness of problems related to dynamical systems [GZ18].…”