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)

Computable symbolic dynamics
Notions of Probabilistic Computability on Represented Spaces
Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
Borel complexity and computability of the Hahn-Banach theorem
An application of Martin-Löf randomness to effective probability theory
On the complexity of convex hulls of subsets of the two-dimensional plane
Abstract geometrical computation. III: Black holes for classical and analog computing
Computable Carathéodory theory
Effectivity and effective continuity of multifunctions
The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
Singular coverings and non‐uniform notions of closed set computability
Computational bounds on polynomial differential equations
A semi-potential for finite and infinite games in extensive form
Continuity and computability of reachable sets
Computability on subsets of metric spaces.
Polynomial differential equations compute all real computable functions on computable compact intervals
Automata theory based on complete residuated lattice-valued logic: Turing machines
Effective Borel measurability and reducibility of functions
A convenient category of domains
Local stability of ergodic averages
Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
Weakly computable real numbers
Computability of countable subshifts in one dimension
The computable multi-functions on multi-represented sets are closed under programming
Reducibilities relating to Schnorr randomness
Computability, noncomputability and undecidability of maximal intervals of IVPs
Weihrauch degrees, omniscience principles and weak computability
Characterizing time computational complexity classes with polynomial differential equations
Boundedness of the domain of definition is undecidable for polynomial ODEs
Pre-apartness structures on spaces of functions
Computing the topological entropy of shifts
Topological properties of concept spaces (full version)
Fixed point theorems on partial randomness
On the asymptotic behavior of odd operators
Complexity issues for preorders on finite labeled forests
CGMurphi: automatic synthesis of numerical controllers for nonlinear hybrid systems
The computational complexity of some Julia sets
Dimension spectra of random subfractals of self-similar fractals
Synthesis of computable regular functions of infinite words
Computation with perturbed dynamical systems
Some computational aspects of metric fixed-point theory
Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
The rate of convergence of the walk on spheres algorithm
Real number computation through Gray code embedding.
Topological properties of real number representations.
Unexpected distribution phenomenon resulting from Cantor series expansions
Closed choice and a uniform low basis theorem
Fixed Point Theorems on Partial Randomness
Effective symbolic dynamics
Abstract geometrical computation. V: Embedding computable analysis
On the computational complexity of the Riemann mapping
Computing interpolating sequences
Optimization problems with fixed volume constraints and stability results related to rearrangement classes
Uniform test of algorithmic randomness over a general space
Computing with polynomial ordinary differential equations
Some remarks on real numbers induced by first-order spectra
Quantitative continuity and Computable Analysis in Coq
Internal Density Theorems for Hierarchies of Continuous Functionals
Revising type-2 computation and degrees of discontinuity
On computable compact operators on Banach spaces
Metric spaces in synthetic topology
Effectivizing Lusin’s Theorem
Unified characterizations of lowness properties via Kolmogorov complexity
Computability and representations of the zero set
Separating notions in effective topology
An effective Riemann Mapping Theorem
Probability, statistics and computation in dynamical systems
An optical model of computation
ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
Computability of the metric projection onto finite-dimensional linear subspaces
Effective Choice and Boundedness Principles in Computable Analysis
Independent subbases and non-redundant codings of separable metrizable spaces
Recent progress in exact geometric computation
The Kolmogorov complexity of infinite words
Computable analysis with applications to dynamic systems
A tutorial on computable analysis
Computability of probability measures and Martin-Löf randomness over metric spaces
Schnorr triviality and its equivalent notions
A stream calculus of bottomed sequences for real number computation
The fan theorem and unique existence of maxima
Coinduction for exact real number computation
Computability in analysis and physics
A blend of methods of recursion theory and topology.
Fine hierarchies and m-reducibilities in theoretical computer science
Computing the topological entropy of shifts
Computable procedures for fields
Computability and the morphological complexity of some dynamics on continuous domains
A computable version of Banach's inverse mapping theorem
Computability of graphs
Computability of solutions of operator equations
Effectively closed sets and graphs of computable real functions.
Complexity of operators on compact sets
Computing the uncomputable; or, the discrete charm of second-order simulacra
Jordan curves with polynomial inverse moduli of continuity
The influence of domain interpretations on computational models
What is a universal computing machine?
On Turing degrees of points in computable topology
Computing Schrödinger propagators on type-2 Turing machines

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)