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 uniform computational content of the Baire category theorem
Comparing representations for function spaces in computable analysis
scientific article; zbMATH DE number 17564 (Why is no real title available?)
Hypergeometric functions in exact geometric computation
Kolmogorov complexity and the geometry of Brownian motion
scientific article; zbMATH DE number 1101599 (Why is no real title available?)
scientific article; zbMATH DE number 1107625 (Why is no real title available?)
Weak colored local rules for planar tilings
Mutual dimension
On the information carried by programs about the objects they compute
On computability and disintegration
Hierarchies of total functionals over the reals
Generated quasi-metric hyper and function spaces.
The closure properties on real numbers under limits and computable operators.
Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
Intuitionistic provability versus uniform provability in \(\mathsf{RCA}\)
The Vitali Covering Theorem in the Weihrauch Lattice
Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
Universality, optimality, and randomness deficiency
The solution operator of the Korteweg-de Vries equation is computable
Computing the solution of the m-Korteweg-de Vries equation on Turing machines
Connected choice and the Brouwer fixed point theorem
scientific article; zbMATH DE number 7577572 (Why is no real title available?)
Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
Uniqueness, continuity and the existence of implicit functions in constructive analysis
Computable topological abelian groups
Representations of complete uniform spaces via uniform domains
The Kripke schema in metric topology
Point Degree Spectra of Represented Spaces
On the computability of a construction of Brownian motion
Generalizing Computability Theory to Abstract Algebras
Dimension spectra of lines
A survey of recursive analysis and Moore's notion of real computation
Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
Uniformly computable aspects of inner functions
On constructive number fields and computability of solutions of PDEs
The Hausdorff and dynamical dimensions of self-affine sponges: a dimension gap result
Warsaw discs and semicomputability
Bounded Turing reductions and data processing inequalities for sequences
On the uniform computational content of computability theory
Algorithmic identification of probabilities is hard
Probabilistic computability and choice
On higher effective descriptive set theory
Computing geometric Lorenz attractors with arbitrary precision
Effective Hausdorff dimension in general metric spaces
\(\Sigma\)-definability in hereditarily finite superstructures and computable analysis
Algorithmic randomness over general spaces
scientific article; zbMATH DE number 1124612 (Why is no real title available?)
On approximations for functions in the space of uniformly convergent Fourier series
On the algebraic structure of Weihrauch degrees
Real number computation with committed choice logic programming languages
Non computable Mandelbrot-like sets for a one-parameter complex family
Semicomputable manifolds in computable topological spaces
Weihrauch Complexity in Computable Analysis
Berechenbare Reelle Funktionenfolgen
Pointwise complexity of the derivative of a computable function
On the relationship between filter spaces and weak limit spaces
The computational complexity of distance functions of two-dimensional domains
Dense computability structures
Towards the Effective Descriptive Set Theory
Wadge hardness in Scott spaces and its effectivization
Wadge-like reducibilities on arbitrary quasi-Polish spaces
Extended admissibility.
Algorithmic randomness and Fourier analysis
Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
A Wadge hierarchy for second countable spaces
Relative computability and uniform continuity of relations
Is the Mandelbrot set computable?
Computability of analytic functions with analytic machines
Embedding infinitely parallel computation in Newtonian kinematics
The many forms of hypercomputation
Points on Computable Curves of Computable Lengths
Complexity of blowup problems (extended abstract)
Towards computability of elliptic boundary value problems in variational formulation
Curves that must be retraced
Towards computability over effectively enumerable topological spaces
A differential operator and weak topology for Lipschitz maps
On computational complexity of Siegel Julia sets
Computability and computational complexity of the evolution of nonlinear dynamical systems
Measures and their random reals
On computability of the Galerkin procedure
Computability, noncomputability, and hyperbolic systems
Effectiveness for embedded spheres and balls
Computability of analog networks
Computable total functions on metric algebras, universal algebraic specifications and dynamical systems
Computable scalar fields: A basis for PDE software
Unifying computers and dynamical systems using the theory of synchronous concurrent algorithms
The derivational complexity of string rewriting systems
Computability and the Implicit Function Theorem
Statistical properties of dynamical systems -- Simulation and abstract computation
Can Newtonian systems, bounded in space, time, mass and energy compute all functions?
Computability in planar dynamical systems
Representation theorems for analytic machines and computability of analytic functions
Experimental computation of real numbers by Newtonian machines
Towards Computational Complexity Theory on Advanced Function Spaces in Analysis
\(K\)-triviality in computable metric spaces
Degrees of unsolvability of continuous functions
Analytical properties of resource-bounded real functionals
On the computing power of fuzzy Turing machines
Effective genericity and differentiability

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)