On the definitions of computable real continuous functions

From MaRDI portal
Publication:3244109


DOI10.4064/fm-44-1-61-71zbMath0079.24801MaRDI QIDQ3244109

Andrzej Grzegorczyk

Publication date: 1957

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/213422



Related Items

Lp‐Computability, Approaches to Effective Semi‐Continuity of Real Functions, Iteration, inequalities, and differentiability in analog computers, A comparison of identification criteria for inductive inference of recursive real-valued functions, Domain representability of metric spaces, Computability in linear algebra, Real functions, contraction mappings, and P-completeness, Three concepts of decidability for general subsets of uncountable spaces, Stability versus speed in a computable algebraic model, Computability versus exact computability of martingales, On the computing power of fuzzy Turing machines, Effectively open real functions, Effective continuities on effective topological spaces, Computing Schrödinger propagators on type-2 Turing machines, Borel complexity and computability of the Hahn-Banach theorem, A computable version of Banach's inverse mapping theorem, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators, Approximation to measurable functions and its relation to probabilistic computation, On the continued fraction representation of computable real numbers, Representations of the real numbers and of the open subsets of the set of real numbers, The wave equation with computable initial data such that its unique solution is not computable, Noncomputability in models of physical phenomena, Computational complexity of real functions, A refined model of computation for continuous problems, Computable invariance, A domain-theoretic approach to computability on the real line, Relatively recursive reals and real functions, Feasible real random access machines, Index sets in computable analysis, Analytic machines, An effective Riemann Mapping Theorem, From axiomatics to intrinsic characterization: some open problems in computable analysis, Concrete models of computation for topological algebras, Computation by `While' programs on topological partial algebras, Computability structure of the Sobolev spaces and its applications, Recursive characterization of computable real-valued functions and relations, PCF extended with real numbers, \(\mu\)-recursion and infinite limits., Random elements in effective topological spaces with measure., Computability on subsets of metric spaces., Grzegorczyk's hierarchy of computable analysis, Effectively closed sets and graphs of computable real functions., Real number computation through Gray code embedding., The closure properties on real numbers under limits and computable operators., Extended admissibility., Computable total functions on metric algebras, universal algebraic specifications and dynamical systems, A Banach-Mazur computable but not Markov computable function on the computable real numbers, The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, An analog characterization of the Grzegorczyk hierarchy, Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma, An abstract data type for real numbers, Polynomial differential equations compute all real computable functions on computable compact intervals, Analog computation beyond the Turing limit, Computable symbolic dynamics, Real Number Calculations and Theorem Proving, Computability and Noncomputability in Classical Analysis, Unnamed Item, Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers), A Real Number Structure that is Effectively Categorical