We will discuss several continuous time models of computation for which a precise characterization of the computational power compared to classical discrete models can be obtained. In particular, we will talk about piecewise constant derivative systems and (variations of) R-recursive functions. This talk will be based on personal results and an ongoing work with Emmanuel Hainry.