A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
From MaRDI portal
Publication:2104133
DOI10.1007/978-3-031-13502-6_4OpenAlexW4290017128MaRDI QIDQ2104133
Publication date: 9 December 2022
Full work available at URL: https://arxiv.org/abs/2209.13599
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new recursion-theoretic characterization of the polytime functions
- Recursive characterization of computable real-valued functions and relations
- On the computational power of neural nets
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Discrete Calculus By Analogy
- A Survey on Analog Models of Computation
- Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
- A recursion theoretic foundation of computation over real numbers
- Intrinsic theories and computational complexity
This page was built for publication: A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
