Computability and Noncomputability in Classical Analysis

DOI10.2307/1999038zbMath0513.03031OpenAlexW4233415116MaRDI QIDQ3657990

Marian Boykan Pour-El, Ian Richards

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/1999038

zbMATH Keywords

Fourier transformsFourier seriescomplex analytic functionstranslation invariant operatorscomputable functionreal variable

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Approximation in the complex plane (30E10) Convergence and absolute convergence of Fourier and trigonometric series (42A20) Applications of computability and recursion theory (03D80) Real-analytic functions (26E05)

Related Items (23)

Undecidability through Fourier series ⋮ Approximation to measurable functions and its relation to probabilistic computation ⋮ Comparing representations for function spaces in computable analysis ⋮ PCF extended with real numbers ⋮ Computing power series in polynomial time ⋮ Complexity of optimizing over the integers ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Recursive analysis of singular ordinary differential equations ⋮ Experimental computation of real numbers by Newtonian machines ⋮ L^p‐Computability ⋮ Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System ⋮ The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not ⋮ On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines ⋮ Computations via Newtonian and relativistic kinematic systems ⋮ What is a universal computing machine? ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis ⋮ Concrete models of computation for topological algebras ⋮ Computability structure of the Sobolev spaces and its applications ⋮ COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM ⋮ Integration in Real PCF ⋮ Classes of matrices for the traveling salesman problem ⋮ Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions. ⋮ Interpolation functor and computability.

Cites Work

• The wave equation with computable initial data such that its unique solution is not computable
• A notion of mechanistic theory
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• Computable functionals
• On the definitions of computable real continuous functions
• A computable ordinary differential equation which possesses no computable solution
• On a simple definition of computable function of a real variable‐with applications to functions of a complex variable
• On the Definition of Computable Function of a Real Variable
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computability and Noncomputability in Classical Analysis