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_4OpenAlexW4290017128MaRDI QIDQ2104133FDOQ2104133

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A tutorial on computable analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• A new recursion-theoretic characterization of the polytime functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the computational power of neural nets
• Polynomial differential equations compute all real computable functions on computable compact intervals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive characterization of computable real-valued functions and relations
• A Survey on Analog Models of Computation
• Title not available (Why is that?)
• A recursion theoretic foundation of computation over real numbers
• Discrete calculus by analogy
• Recursion Schemes, Discrete Differential Equations and Characterization of Polynomial Time Computations
• Intrinsic theories and computational complexity

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)