On the definitions of computable real continuous functions

Cited in

(only showing first 100 items - show all)

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.
A topological view on algebraic computation models
On the information carried by programs about the objects they compute
Abstract geometrical computation. V: Embedding computable analysis
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
Algorithmic randomness and Fourier analysis
Computability, noncomputability, and hyperbolic systems
Models of computation for partial functions on the reals
Parametrised second-order complexity theory with applications to the study of interval computation
Moduli of regularity and rates of convergence for Fejér monotone sequences
Polynomial differential equations compute all real computable functions on computable compact intervals
Analog computation beyond the Turing limit
On the Computable Theory of Bounded Analytic Functions
Rohlin properties for \(\mathbb {Z}^{d}\) actions on the Cantor set
A lightface analysis of the differentiability rank
Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
Computable symbolic dynamics
Real Number Calculations and Theorem Proving
Computation with perturbed dynamical systems
First-order universality for real programs
Computability of analytic functions with analytic machines
Computability and Noncomputability in Classical Analysis
scientific article; zbMATH DE number 3705909 (Why is no real title available?)
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
On the computational complexity of the Dirichlet problem for Poisson's equation
L^p‐Computability
Approaches to Effective Semi‐Continuity of Real Functions
Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
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
Complexity of blowup problems (extended abstract)
Effective symbolic dynamics
Computable analysis and notions of continuity in \textsc{Coq}
Average-case polynomial-time computability of Hamiltonian dynamics
Computability of Real Numbers
Computable complex analysis
Admissibly Represented Spaces and Qcb-Spaces
Three topological reducibilities for discontinuous functions
Intersection points of planar curves can be computed
Continuous and monotone machines
Physical computability theses
Solovay reducibility and continuity
Feferman on computability
Computable analysis with applications to dynamic systems
Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
When series of computable functions with varying domains are computable
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
Semantics of computable physical models
COMPUTABLY COMPACT METRIC SPACES
Effectiveness in RPL, with applications to continuous logic
Feasible real random access machines
Theoretical computer science: computability, decidability and logic
Domain representability of metric spaces
Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
Representation theorems for analytic machines and computability of analytic functions
Computability in linear algebra
A variational framework for the complexity of PDE solutions
Real functions, contraction mappings, and P-completeness

This page was built for publication: On the definitions of computable real continuous functions

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