On the definitions of computable real continuous functions

1957/01/01 by Andrzej Grzegorczyk · 11 citations
Computer Science · #Computability, Logic, AI Algorithms

paper · doi:10.4064/fm-44-1-61-71

Cited by

• The grounding for Continuum
• A Variational Framework for the Algorithmic Complexity of PDE Solutions
• Notions of computability at higher types I
• On the close interaction between algorithmic randomness and constructive/computable measure theory
• Cheap Non-standard Analysis and Computability
• Computability, Noncomputability, and Hyperbolic Systems
• Real Hypercomputation and Continuity
• Effectively open real functions
• Effectiveness in RPL, with applications to continuous logic
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
• A Survey of Exact Arithmetic Implementations