Computability and noncomputability in classical analysis

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 C n {C^n} , C ∞ {C^∞ } , 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.