On the Definition of Computable Function of a Real Variable

DOI10.1002/malq.19760220148zbMath0359.02029OpenAlexW1995491785MaRDI QIDQ4132502

John C. Shepherdson

Publication date: 1976

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

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

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (17)

Coupled map lattices as computational systems ⋮ Continuous optimization problems and a polynomial hierarchy of real functions ⋮ Approximation to measurable functions and its relation to probabilistic computation ⋮ What is the Church-Turing Thesis? ⋮ Recursive characterization of computable real-valued functions and relations ⋮ Computability and Noncomputability in Classical Analysis ⋮ When series of computable functions with varying domains are computable ⋮ Computable total functions on metric algebras, universal algebraic specifications and dynamical systems ⋮ L^p‐Computability ⋮ Semantics of algorithmic languages ⋮ 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 ⋮ On approximate and algebraic computability over the real numbers ⋮ Computation by `While' programs on topological partial algebras ⋮ Computability structure of the Sobolev spaces and its applications ⋮ Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I ⋮ Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators

This page was built for publication: On the Definition of Computable Function of a Real Variable