Showing cs.CCShow all
2 papers · 1 filter
cs.CC2024
The complexity of computing in continuous time: space complexity is precision
Manon Blanc, Olivier Bournez
Models of computations over the integers are equivalent from a computability and complexity theory point of view by the Church-Turing thesis. It is not possible to unify discrete-t…
cs.CC2022
Polynomial time computable functions over the reals characterized using discrete ordinary differential equations
Manon Blanc, Olivier Bournez
The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also kn…