On the definitions of computable real continuous functions
From MaRDI portal
Publication:3244109
DOI10.4064/fm-44-1-61-71zbMath0079.24801OpenAlexW220096824MaRDI QIDQ3244109
Publication date: 1957
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/213422
Related Items
Semantics of computable physical models, COMPUTABLY COMPACT METRIC SPACES, Quantitative continuity and Computable Analysis in Coq, Iteration, inequalities, and differentiability in analog computers, A comparison of identification criteria for inductive inference of recursive real-valued functions, Rohlin properties for $\mathbb{Z}^{d}$ actions on the Cantor set, An analog characterization of the Grzegorczyk hierarchy, Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations, Three topological reducibilities for discontinuous functions, Computability versus exact computability of martingales, On the computing power of fuzzy Turing machines, Approximation to measurable functions and its relation to probabilistic computation, Polynomial differential equations compute all real computable functions on computable compact intervals, On the continued fraction representation of computable real numbers, Recursive characterization of computable real-valued functions and relations, PCF extended with real numbers, Representations of the real numbers and of the open subsets of the set of real numbers, A LIGHTFACE ANALYSIS OF THE DIFFERENTIABILITY RANK, Effectively open real functions, Effective continuities on effective topological spaces, Computing Schrödinger propagators on type-2 Turing machines, Intersection points of planar curves can be computed, Computation with perturbed dynamical systems, Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma, A topological view on algebraic computation models, Unnamed Item, On the computational complexity of the Dirichlet Problem for Poisson's Equation, \(\mu\)-recursion and infinite limits., On the information carried by programs about the objects they compute, Random elements in effective topological spaces with measure., Computability and Noncomputability in Classical Analysis, Superefficiency from the vantage point of computability, Unnamed Item, The wave equation with computable initial data such that its unique solution is not computable, Effectiveness in RPL, with applications to continuous logic, Physical Computability Theses, Computable symbolic dynamics, An abstract data type for real numbers, Noncomputability in models of physical phenomena, Computability on subsets of metric spaces., Computational complexity of real functions, Borel complexity and computability of the Hahn-Banach theorem, Real Number Calculations and Theorem Proving, Solovay reducibility and continuity, When series of computable functions with varying domains are computable, Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy, Average-case polynomial-time computability of hamiltonian dynamics, Domain representability of metric spaces, Computing Uniform Bounds, Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis, Fixed Points on the Real Numbers without the Equality Test, A Natural Weak Limit Space with Admissible Representation which is not a Limit Space, Effectively Absolute Continuity and Effective Jordan Decomposability, Algorithmic randomness and Fourier analysis, Complexity of Blowup Problems, Effective Symbolic Dynamics, First-Order Universality for Real Programs, Computability of Analytic Functions with Analytic Machines, Representation theorems for analytic machines and computability of analytic functions, Abstract geometrical computation. V: Embedding computable analysis, Models of computation for partial functions on the reals, 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, Computability in linear algebra, Computability, noncomputability, and hyperbolic systems, Analog computation beyond the Turing limit, Parametrised second-order complexity theory with applications to the study of interval computation, A computable version of Banach's inverse mapping theorem, Lp‐Computability, Approaches to Effective Semi‐Continuity of Real Functions, Feferman on Computability, Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers), A refined model of computation for continuous problems, Computable analysis with applications to dynamic systems, Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System, Continuous and monotone machines, Computable invariance, A domain-theoretic approach to computability on the real line, Relatively recursive reals and real functions, The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not, Feasible real random access machines, Moduli of regularity and rates of convergence for Fejér monotone sequences, Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics, Grzegorczyk's hierarchy of computable analysis, 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, Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators, On the Computable Theory of Bounded Analytic Functions, Computability of Real Numbers, Computable Complex Analysis, Admissibly Represented Spaces and Qcb-Spaces, Real functions, contraction mappings, and P-completeness, 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., A Real Number Structure that is Effectively Categorical, Three concepts of decidability for general subsets of uncountable spaces, Stability versus speed in a computable algebraic model, Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
