On the definitions of computable real continuous functions

Cited in

(only showing first 100 items - show all)

Noncomputability in models of physical phenomena
Approaches to Effective Semi‐Continuity of Real Functions
Effectively closed sets and graphs of computable real functions.
Computability and Noncomputability in Classical Analysis
Stability versus speed in a computable algebraic model
Three concepts of decidability for general subsets of uncountable spaces
Computability of analytic functions with analytic machines
An effective Riemann Mapping Theorem
Computability of Real Numbers
Domain representability of metric spaces
Approximation to measurable functions and its relation to probabilistic computation
Continuous and monotone machines
Real functions, contraction mappings, and P-completeness
On the continued fraction representation of computable real numbers
Algorithmic randomness and Fourier analysis
L^p‐Computability
Feasible real random access machines
When series of computable functions with varying domains are computable
Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
Parametrised second-order complexity theory with applications to the study of interval computation
Computational complexity of real functions
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
Representations of the real numbers and of the open subsets of the set of real numbers
A natural weak limit space with admissible representation which is not a limit space
Admissibly Represented Spaces and Qcb-Spaces
Computable analysis and notions of continuity in \textsc{Coq}
Intersection points of planar curves can be computed
Abstract Computability and Its Relation to the General Purpose Analog Computer (Some Connections Between Logic, Differential Equations and Analog Computers)
A Banach-Mazur computable but not Markov computable function on the computable real numbers
A refined model of computation for continuous problems
Complexity of blowup problems (extended abstract)
Borel complexity and computability of the Hahn-Banach theorem
Iteration, inequalities, and differentiability in analog computers
Fixed points on the real numbers without the equality test
Effectively absolute continuity and effective Jordan decomposability
Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics
Real Number Calculations and Theorem Proving
Relatively recursive reals and real functions
PCF extended with real numbers
Computability in linear algebra
Computable invariance
The closure properties on real numbers under limits and computable operators.
Effectively open real functions
Effective continuities on effective topological spaces
On the computational complexity of the Dirichlet problem for Poisson's equation
Feferman on computability
Average-case polynomial-time computability of Hamiltonian dynamics
Computability on subsets of metric spaces.
Effective symbolic dynamics
\(\mu\)-recursion and infinite limits.
Real number computation through Gray code embedding.
Abstract geometrical computation. V: Embedding computable analysis
COMPUTABLY COMPACT METRIC SPACES
Physical computability theses
Index sets in computable analysis
From axiomatics to intrinsic characterization: some open problems in computable analysis
A computable version of Banach's inverse mapping theorem
The wave equation with computable initial data such that its unique solution is not computable
Theoretical computer science: computability, decidability and logic
Computability structure of the Sobolev spaces and its applications
Analytic machines
Computing Schrödinger propagators on type-2 Turing machines
An abstract data type for real numbers
Noncomputability in analysis and physics: A complete determination of the class of noncomputable linear operators
Semantics of computable physical models
An analog characterization of the Grzegorczyk hierarchy
On the Computable Theory of Bounded Analytic Functions
Recursive characterization of computable real-valued functions and relations
A topological view on algebraic computation models
Computable complex analysis
Models of computation for partial functions on the reals
Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
Undecidability in Rⁿ: Riddled Basins, the KAM Tori, and the Stability of the Solar System
The eigenvalues of an effectively determined self-adjoint operator are computable, but the sequence of eigenvalues is not
On the computing power of fuzzy Turing machines
A comparison of identification criteria for inductive inference of recursive real-valued functions
Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
Solovay reducibility and continuity
Feasible real random access machines
Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
Superefficiency from the vantage point of computability
Computability versus exact computability of martingales
Three topological reducibilities for discontinuous functions
Moduli of regularity and rates of convergence for Fejér monotone sequences
Effectiveness in RPL, with applications to continuous logic
Computable symbolic dynamics
Quantitative continuity and Computable Analysis in Coq
A Real Number Structure that is Effectively Categorical
Computing uniform bounds
scientific article; zbMATH DE number 3705909 (Why is no real title available?)
Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
Computation with perturbed dynamical systems
First-order universality for real programs
Computable analysis with applications to dynamic systems
Representation theorems for analytic machines and computability of analytic functions
Concrete models of computation for topological algebras
Computation by `While' programs on topological partial algebras
Rohlin properties for \(\mathbb {Z}^{d}\) actions on the Cantor set
Random elements in effective topological spaces with measure.
A lightface analysis of the differentiability rank

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)