Computability and Noncomputability in Classical Analysis
- 1 February 1983
- journal article
- Published by JSTOR in Transactions of the American Mathematical Society
- Vol. 275 (2), 539-560
- https://doi.org/10.2307/1999038
Abstract
This paper treats in a systematic way the following question: which basic constructions in real and complex analysis lead from the computable to the noncomputable, and which do not? The topics treated include: computability for , <!-- MATH ${C^\infty }$ --> , real analytic functions, Fourier series, and Fourier transforms. A final section presents a more general approach via "translation invariant operators". Particular attention is paid to those processes which occur in physical applications. The approach to computability is via the standard notion of recursive function from mathematical logic.
Keywords
This publication has 11 references indexed in Scilit:
- The wave equation with computable initial data such that its unique solution is not computableAdvances in Mathematics, 1981
- A computable ordinary differential equation which possesses no computable solutionAnnals of Mathematical Logic, 1979
- On the Definition of Computable Function of a Real VariableMathematical Logic Quarterly, 1976
- On a simple definition of computable function of a real variable-with applications to functions of a complex variableMathematical Logic Quarterly, 1975
- A recursive function, defined on a compact interval and having a continuous derivative that is not recursive.The Michigan Mathematical Journal, 1971
- An Introduction to Harmonic Analysis.The American Mathematical Monthly, 1970
- Foundations of Constructive Analysis.The American Mathematical Monthly, 1968
- Intuitionism. An Introduction. By A. Heyting. Pp. viii +132. 24s. 1956 (North Holland Publishing Company, Amsterdam)The Mathematical Gazette, 1957
- On the definitions of computable real continuous functionsFundamenta Mathematicae, 1957
- Computable functionalsFundamenta Mathematicae, 1955