On a simple definition of computable function of a real variable‐with applications to functions of a complex variable

DOI10.1002/malq.19750210102zbMath0323.02049OpenAlexW1975917923MaRDI QIDQ4085712

Marian Boykan Pour-El, Jerome Caldwell

Publication date: 1975

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19750210102

Mathematics Subject Classification ID

Approximation by polynomials (41A10) Polynomials and rational functions of one complex variable (30C10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (29)

Approximation to measurable functions and its relation to probabilistic computation ⋮ Recursive characterization of computable real-valued functions and relations ⋮ Degrees of unsolvability of continuous functions ⋮ Unnamed Item ⋮ Computability and Noncomputability in Classical Analysis ⋮ COMPUTABLY COMPACT METRIC SPACES ⋮ Unnamed Item ⋮ The wave equation with computable initial data such that its unique solution is not computable ⋮ Order-free Recursion on the Real Numbers ⋮ Uniformly computable aspects of inner functions: estimation and factorization ⋮ Noncomputability in models of physical phenomena ⋮ Undecidability and incompleteness in classical mechanics ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy ⋮ Notes on computable analysis ⋮ Uniformly Computable Aspects of Inner Functions ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ Computability in linear algebra ⋮ Computable analysis and Blaschke products ⋮ Effective Choice and Boundedness Principles in Computable Analysis ⋮ Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System ⋮ Relatively recursive reals and real functions ⋮ The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not ⋮ On the computational complexity of best Chebyshev approximations ⋮ From axiomatics to intrinsic characterization: some open problems in computable analysis ⋮ Computation by `While' programs on topological partial algebras ⋮ Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators ⋮ On the Computable Theory of Bounded Analytic Functions ⋮ Computable Complex Analysis

This page was built for publication: On a simple definition of computable function of a real variable‐with applications to functions of a complex variable