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)

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
Hierarchies of function classes defined by the first-value operator
Problems, solutions, and completions
Constructing locally connected non-computable Julia sets
Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
Abstract State Machines with Exact Real Arithmetic
Are unbounded linear operators computable on the average for Gaussian measures?
Proceedings of the 6th workshop on computability and complexity in analysis (CCA 2004), Lutherstadt Wittenberg, Germany, August 16--20, 2004
The Church-Turing Thesis over Arbitrary Domains
Quantitative coding and complexity theory of compact metric spaces
An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable
A blend of methods of recursion theory and topology: a \(\Pi_1^0\) tree of shadow points
Language equations
Programming Experimental Procedures for Newtonian Kinematic Machines
Online computations of differentiable functions
On the complexity of computing the Hausdorff distance
On the computational content of the Lawson topology
On the complexity of computing the logarithm and square root functions on a complex domain
Effective subsets under homeomorphisms of \(\mathbb{R}^n\)
Effective continuities on effective topological spaces
Random elements in effective topological spaces with measure.
The basic feasible functionals in computable analysis
A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
Computability of Real Numbers
Seven kinds of computable and constructive infelicities in economics
THE DISCONTINUITY PROBLEM
Game characterizations and lower cones in the Weihrauch degrees
Computations via Newtonian and relativistic kinematic systems
Alan Turing and the foundations of computable analysis
A hypercomputational alien
Topological Properties of Concept Spaces
On the lattices of effectively open sets
The P\(\neq\) NP conjecture in the context of real and complex analysis
The computable kernel of abstract state machines
A Survey on Analog Models of Computation
Type two computability of social choice functions and the Gibbard-Satterthwaite theorem in an infinite society
The Gibbard-Satterthwaite theorem of social choice theory in an infinite society and LPO (limited principle of omniscience)
Intuitionistic fixed point logic
Computable analysis and Blaschke products
A topological view on algebraic computation models
PAC learning, VC dimension, and the arithmetic hierarchy
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

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)