Publication:3788007
From MaRDI portal
zbMath0645.03060MaRDI QIDQ3788007
Publication date: 1987
integration; Taylor series; analytic continuation; analytic real function; constructive analysis; polynomial time computable functions; polynomial time computable analytic functions
68Q25: Analysis of algorithms and problem complexity
03F60: Constructive and recursive analysis
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
On the computational complexity of the Dirichlet Problem for Poisson's Equation, Lower Bounds on the Continuation of Holomorphic Functions, Representations and evaluation strategies for feasibly approximable functions, Computability of Differential Equations, Computing the exact number of periodic orbits for planar flows, Average-case polynomial-time computability of hamiltonian dynamics, Computability and Computational Complexity of the Evolution of Nonlinear Dynamical Systems, The complexity of divisibility, On the complexity of online computations of real functions, A refined model of computation for continuous problems, Computability on computable metric spaces, Type 2 computational complexity of functions on Cantor's space