A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations

DOI10.1007/978-3-031-13502-6_4MaRDI QIDQ2104133zbMATH OpenOpenAlexFDO

Authors Manon Blanc, Olivier Bournez

Publication date 9 December 2022

Full work available at URL https://arxiv.org/abs/2209.13599

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 445159 (Why is no real title available?)
• scientific article; zbMATH DE number 52121 (Why is no real title available?)
• scientific article; zbMATH DE number 194009 (Why is no real title available?)
• scientific article; zbMATH DE number 3622154 (Why is no real title available?)
• scientific article; zbMATH DE number 1260390 (Why is no real title available?)
• scientific article; zbMATH DE number 2079048 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• scientific article; zbMATH DE number 953683 (Why is no real title available?)
• scientific article; zbMATH DE number 806752 (Why is no real title available?)
• scientific article; zbMATH DE number 1390027 (Why is no real title available?)
• scientific article; zbMATH DE number 3292104 (Why is no real title available?)
• scientific article; zbMATH DE number 3416363 (Why is no real title available?)
• scientific article; zbMATH DE number 3109695 (Why is no real title available?)
• A Survey on Analog Models of Computation
• A new recursion-theoretic characterization of the polytime functions
• A recursion theoretic foundation of computation over real numbers
• A tutorial on computable analysis
• Discrete calculus by analogy
• Intrinsic theories and computational complexity
• On the computational power of neural nets
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
• Recursive characterization of computable real-valued functions and relations

Cited in

(1)

• Polynomial differential equations compute all real computable functions on computable compact intervals

This page was built for publication: A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104133)