Upper and lower bounds on continuous-time computation
From MaRDI portal
Recommendations
- Analog computers and recursive functions over the reals.
- Recursion theory on the reals and continuous-time computation
- An analog characterization of the Grzegorczyk hierarchy
- Continuous-time computation with restricted integration capabilities
- Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length: the general purpose analog computer and computable analysis are two efficiently equivalent models of computations
Cited in
(11)- Computational bounds on polynomial differential equations
- Dynamical recognizers: real-time language recognition by analog computers
- Analog computers and recursive functions over the reals.
- Continuous-time computation with restricted integration capabilities
- An analog characterization of the Grzegorczyk hierarchy
- scientific article; zbMATH DE number 4160128 (Why is no real title available?)
- scientific article; zbMATH DE number 1008514 (Why is no real title available?)
- A survey on continuous time computations
- Characterizing time computational complexity classes with polynomial differential equations
- Piecewise rational affine maps, multidimensional generalized shifts, and computation over the real numbers
- An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
This page was built for publication: Upper and lower bounds on continuous-time computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707531)
