Computability and Noncomputability in Classical Analysis

DOI10.2307/1999038MaRDI QIDQ3657990zbMATH OpenOpenAlexFDO

Authors Marian Boykan Pour-El, Ian Richards

Publication date 1983

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

zbMATH Keywords

complex analytic functionscomputable functionFourier seriesFourier transformsreal variabletranslation invariant operators

Mathematics Subject Classification ID

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

Cites work

• A computable ordinary differential equation which possesses no computable solution
• A notion of mechanistic theory
• A recursive function, defined on a compact interval and having a continuous derivative that is not recursive
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• Computable functionals
• scientific article; zbMATH DE number 3720907 (Why is no real title available?)
• scientific article; zbMATH DE number 3547903 (Why is no real title available?)
• scientific article; zbMATH DE number 3616422 (Why is no real title available?)
• scientific article; zbMATH DE number 3202577 (Why is no real title available?)
• scientific article; zbMATH DE number 3230252 (Why is no real title available?)
• scientific article; zbMATH DE number 3271504 (Why is no real title available?)
• scientific article; zbMATH DE number 3310901 (Why is no real title available?)
• scientific article; zbMATH DE number 3110188 (Why is no real title available?)
• 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
• On the definitions of computable real continuous functions
• The wave equation with computable initial data such that its unique solution is not computable

Cited in

(26)

• Computations via Newtonian and relativistic kinematic systems
• What is a universal computing machine?
• Approximation to measurable functions and its relation to probabilistic computation
• Computing power series in polynomial time
• 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
• PCF extended with real numbers
• Uniform computational complexity of the derivatives of \(C^{\infty}\)-functions.
• Interpolation functor and computability.
• Comparing representations for function spaces in computable analysis
• The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
• Integration in Real PCF
• Undecidability through Fourier series
• Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
• L^p‐Computability
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Experimental computation of real numbers by Newtonian machines
• Computability of Polish spaces up to homeomorphism
• Complexity of optimizing over the integers
• COMPUTABLY COMPACT METRIC SPACES
• Recursive analysis of singular ordinary differential equations
• Computable classifications of continuous, transducer, and regular functions
• Some open questions and recent results on computable Banach spaces
• The geometry of computable Banach spaces
• Classes of matrices for the traveling salesman problem

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

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