On the Definition of Computable Function of a Real Variable

DOI10.1002/MALQ.19760220148zbMATH Open0359.02029OpenAlexW1995491785MaRDI QIDQ4132502FDOQ4132502

John 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

Recommendations

• Relatively computable functions of real variables
• scientific article; zbMATH DE number 1344955
• Models of computation for partial functions on the reals
• A tutorial on computable analysis
• On a relative computability notion for real functions

Mathematics Subject Classification ID

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

Cited In (31)

• What is the Church-Turing Thesis?
• Approximation to measurable functions and its relation to probabilistic computation
• On approximate and algebraic computability over the real numbers
• L^p‐Computability
• When series of computable functions with varying domains are computable
• Relatively computable functions of real variables
• Title not available (Why is that?)
• Machines, Computations, and Universality
• On the computational complexity of best Chebyshev approximations
• Title not available (Why is that?)
• The stability of Turing machine in computing real functions
• KONSTRUKTIVE REELLE FUNKTIONALE UND OPERATOREN
• Computability structure of the Sobolev spaces and its applications
• Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
• Recursive characterization of computable real-valued functions and relations
• The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Coupled map lattices as computational systems
• Semantics of algorithmic languages
• Real-world computers and recursive function theory
• Continuous optimization problems and a polynomial hierarchy of real functions
• Title not available (Why is that?)
• Computation by `While' programs on topological partial algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Reducibilities on real numbers
• Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
• Computability and Noncomputability in Classical Analysis

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

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