scientific article; zbMATH DE number 1460545
From MaRDI portal
Publication:4485693
zbMATH Open0956.68056MaRDI QIDQ4485693FDOQ4485693
Authors: Klaus Weihrauch 
Publication date: 18 June 2000
Title of this publication is not available (Why is that?)
Recommendations
computable analysiscomputabilityTuring machinestype-2 theory of effectivitycomputable metric spacesnaming systems
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)
- CGMurphi: automatic synthesis of numerical controllers for nonlinear hybrid systems
- Dimension spectra of random subfractals of self-similar fractals
- A stream calculus of bottomed sequences for real number computation
- Computability of countable subshifts in one dimension
- Separating notions in effective topology
- Computing the topological entropy of shifts
- Fixed point theorems on partial randomness
- Closed choice and a uniform low basis theorem
- Effectivizing Lusin’s Theorem
- The fan theorem and unique existence of maxima
- Notions of Probabilistic Computability on Represented Spaces
- Abstract geometrical computation. III: Black holes for classical and analog computing
- Weakly computable real numbers
- Independent subbases and non-redundant codings of separable metrizable spaces
- Characterizing time computational complexity classes with polynomial differential equations
- On the complexity of finding circumscribed rectangles and squares for a two-dimensional domain
- Reducibilities relating to Schnorr randomness
- On the asymptotic behavior of odd operators
- Coinduction for exact real number computation
- Borel complexity and computability of the Hahn-Banach theorem
- Computational bounds on polynomial differential equations
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra
- Recent progress in exact geometric computation
- On the complexity of convex hulls of subsets of the two-dimensional plane
- Continuity and computability of reachable sets
- Title not available (Why is that?)
- Probability, statistics and computation in dynamical systems
- Automata theory based on complete residuated lattice-valued logic: Turing machines
- Effective symbolic dynamics
- Computable Carathéodory theory
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Computability on subsets of metric spaces.
- Pre-apartness structures on spaces of functions
- Some computational aspects of metric fixed-point theory
- Real number computation through Gray code embedding.
- Topological properties of real number representations.
- Abstract geometrical computation. V: Embedding computable analysis
- An optical model of computation
- Computability of the metric projection onto finite-dimensional linear subspaces
- Fine hierarchies and m-reducibilities in theoretical computer science
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Optimization problems with fixed volume constraints and stability results related to rearrangement classes
- Computing with polynomial ordinary differential equations
- Some remarks on real numbers induced by first-order spectra
- Metric spaces in synthetic topology
- A tutorial on computable analysis
- Boundedness of the domain of definition is undecidable for polynomial ODEs
- Complexity issues for preorders on finite labeled forests
- Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
- Revising type-2 computation and degrees of discontinuity
- On computable compact operators on Banach spaces
- Computability of probability measures and Martin-Löf randomness over metric spaces
- A blend of methods of recursion theory and topology.
- Computable procedures for fields
- The computable multi-functions on multi-represented sets are closed under programming
- Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism
- Weihrauch degrees, omniscience principles and weak computability
- Unexpected distribution phenomenon resulting from Cantor series expansions
- The Kolmogorov complexity of infinite words
- Computability in analysis and physics
- A semi-potential for finite and infinite games in extensive form
- An application of Martin-Löf randomness to effective probability theory
- Topological properties of concept spaces (full version)
- Uniform test of algorithmic randomness over a general space
- Quantitative continuity and Computable Analysis in Coq
- Unified characterizations of lowness properties via Kolmogorov complexity
- Schnorr triviality and its equivalent notions
- Computable symbolic dynamics
- Computability and representations of the zero set
- Effective Choice and Boundedness Principles in Computable Analysis
- Effective Borel measurability and reducibility of functions
- Computable analysis with applications to dynamic systems
- Computation with perturbed dynamical systems
- Singular coverings and non‐uniform notions of closed set computability
- Computability, noncomputability and undecidability of maximal intervals of IVPs
- Fixed Point Theorems on Partial Randomness
- Computing interpolating sequences
- The computational complexity of some Julia sets
- Polynomial differential equations compute all real computable functions on computable compact intervals
- A convenient category of domains
- Local stability of ergodic averages
- On the computational complexity of the Riemann mapping
- Effectivity and effective continuity of multifunctions
- The rate of convergence of the walk on spheres algorithm
- Computing the topological entropy of shifts
- An effective Riemann Mapping Theorem
- ON THE COMPLEXITY OF CLASSIFYING LEBESGUE SPACES
- Internal Density Theorems for Hierarchies of Continuous Functionals
- Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions
- Sorting real numbers in \(O(n \sqrt{\log n})\) time and linear space
- Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Representations of complete uniform spaces via uniform domains
- \(\Sigma\)-definability in hereditarily finite superstructures and computable analysis
- On higher effective descriptive set theory
- Pointwise complexity of the derivative of a computable function
- Algorithmic identification of probabilities is hard
- The closure properties on real numbers under limits and computable operators.
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)
