scientific article; zbMATH DE number 1460545

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Continuity and related questions (modulus of continuity, semicontinuity, discontinuities, etc.) for real functions in one variable (26A15) Complexity of computation (including implicit computational complexity) (03D15) Constructive and recursive analysis (03F60) Constructive real analysis (26E40)

Cited in

(only showing first 100 items - show all)

On the complexity of computing the Hausdorff distance
Real computations with fake numbers
Recursive quasi-metric spaces.
Internal Density Theorems for Hierarchies of Continuous Functionals
On the difference hierarchy in countably based \(T_{0}\)-spaces
A semilattice of degrees of computable metrics
New degree spectra of Polish spaces
Computability of Real Numbers
Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
Uniform procedures in uncountable structures
Computable analysis and Blaschke products
Relating syntactic and semantic perturbations of hybrid automata
Continuous and monotone machines
The Wadge order on the Scott domain is not a well-quasi-order
Uniformly computable aspects of inner functions: estimation and factorization
Abstract State Machines with Exact Real Arithmetic
Arithmetical hierarchy of the Besicovitch-stability of noisy tilings
Sheaf toposes for realizability
CGMurphi: automatic synthesis of numerical controllers for nonlinear hybrid systems
An arithmetic analysis of closed surfaces
Dimension spectra of random subfractals of self-similar fractals
Guessing singular dependencies
Computability on random events and variables in a computable probability space
Computing Solutions of Symmetric Hyperbolic Systems of PDE's
scientific article; zbMATH DE number 7559499 (Why is no real title available?)
Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
Constructive game logic
Absolutely non-computable predicates and functions in analysis
2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08
A stream calculus of bottomed sequences for real number computation
On the convergence of Fourier series of computable Lebesgue integrable functions
Computability of measurable sets via effective metrics
Computing on the Banach space C [ 0 , 1 ]
The computable kernel of abstract state machines
A characterization of polynomial time computable functions from the integers to the reals using discrete ordinary differential equations
Computational complexity of classical solutions of partial differential equations
On envelopes and backward approximations
Effective compactness and orbits of points under the isometry group
Metric spaces are universal for bi-interpretation with metric structures
Liouville numbers and the computational complexity of changing bases
On the complexity of conversion between classic real number representations
Some notes on spaces of ideals and computable topology
In Praise of Numerical Computation
How incomputable is the separable Hahn-Banach theorem?
Exact real computation of solution operators for linear analytic systems of partial differential equations
Primitive recursive ordered fields and some applications
Computability of countable subshifts in one dimension
Effectivity on continuous functions in topological spaces
Algorithmic randomness and Fourier analysis
Computability of measurable sets via effective topologies
Betwixt Turing and Kleene
Computable and Continuous Partial Homomorphisms on Metric Partial Algebras
A constructive theory of point-set nearness.
On the hierarchy and extension of monotonically computable real numbers.
Computable approximations of a chainable continuum with a computable endpoint
Effective weak and vague convergence of measures on the real line
Jordan Areas and Grids
Representing probability measures using probabilistic processes
Statistical properties of dynamical systems -- Simulation and abstract computation
Wormholes, superfast computations, and Selivanov's theorem
Prediction of Recursive Real-Valued Functions from Finite Examples
Completion of choice
Computable analysis of the abstract Cauchy problem in a Banach space and its applications I
Fixed point theorems on partial randomness
Randomness for non-computable measures
When series of computable functions with varying domains are computable
Closed choice and a uniform low basis theorem
On the uniform computational content of Ramsey's theorem
Semantics, specification logic, and Hoare logic of exact real computation
Closure properties for fuzzy recursively enumerable languages and fuzzy recursive languages
Parametrised second-order complexity theory with applications to the study of interval computation
Computing the topological entropy of shifts
Separating notions in effective topology
Computability and Beltrami fields in Euclidean space
Effective notions of weak convergence of measures on the real line
A computable approach to measure and integration theory
Practical stability analysis of sliding-mode control with explicit computation of sampling time
Complexity of operators on compact sets
scientific article; zbMATH DE number 17564 (Why is no real title available?)
Investigations on the approximability and computability of the Hilbert transform with applications
Abstract geometrical computation. III: Black holes for classical and analog computing
On the Effective Existence of Schauder Bases
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
Computability of compact operators on computable Banach spaces with bases
Proof mining in \(L_{1}\)-approximation
Online computations of differentiable functions
A certified, corecursive implementation of exact real numbers
Primitive recursive ordered fields and some applications
Effectivizing Lusin’s Theorem
A natural weak limit space with admissible representation which is not a limit space
\(\mathcal{E}^2\)-computability of \(e\), \(\pi\) and other famous constants
Computable elements and functions in effectively enumerable topological spaces
Independent subbases and non-redundant codings of separable metrizable spaces
scientific article; zbMATH DE number 1101599 (Why is no real title available?)
scientific article; zbMATH DE number 1107625 (Why is no real title available?)
Notions of Probabilistic Computability on Represented Spaces
The fan theorem and unique existence of maxima
Admissibly Represented Spaces and Qcb-Spaces
Computability of Subsets of Metric Spaces
Computable analysis and notions of continuity in \textsc{Coq}

This page was built for publication:

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