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)
- 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
- Algorithmic randomness over general spaces
- The closure properties on real numbers under limits and computable operators.
- Berechenbare Reelle Funktionenfolgen
- On the uniform computational content of the Baire category theorem
- Comparing representations for function spaces in computable analysis
- Hierarchies of total functionals over the reals
- Dimension spectra of lines
- A survey of recursive analysis and Moore's notion of real computation
- Bounded Turing reductions and data processing inequalities for sequences
- Generated quasi-metric hyper and function spaces.
- The Vitali Covering Theorem in the Weihrauch Lattice
- Generalizing Computability Theory to Abstract Algebras
- Uniformly computable aspects of inner functions
- Universality, optimality, and randomness deficiency
- Weak colored local rules for planar tilings
- The solution operator of the Korteweg-de Vries equation is computable
- Computing the solution of the m-Korteweg-de Vries equation on Turing machines
- On computability and disintegration
- Probabilistic computability and choice
- On approximations for functions in the space of uniformly convergent Fourier series
- Real number computation with committed choice logic programming languages
- Non computable Mandelbrot-like sets for a one-parameter complex family
- Hypergeometric functions in exact geometric computation
- Uniqueness, continuity and the existence of implicit functions in constructive analysis
- Effective Hausdorff dimension in general metric spaces
- Computing geometric Lorenz attractors with arbitrary precision
- Mutual dimension
- Abstract geometrical computation. VIII: Small machines, accumulations \& rationality
- The Hausdorff and dynamical dimensions of self-affine sponges: a dimension gap result
- On the computability of a construction of Brownian motion
- Weihrauch Complexity in Computable Analysis
- Title not available (Why is that?)
- Kolmogorov complexity and the geometry of Brownian motion
- Connected choice and the Brouwer fixed point theorem
- On the relationship between filter spaces and weak limit spaces
- On the information carried by programs about the objects they compute
- On the uniform computational content of computability theory
- Computable topological abelian groups
- Semicomputable manifolds in computable topological spaces
- Title not available (Why is that?)
- The Kripke schema in metric topology
- Point Degree Spectra of Represented Spaces
- On the algebraic structure of Weihrauch degrees
- On constructive number fields and computability of solutions of PDEs
- Warsaw discs and semicomputability
- Intuitionistic provability versus uniform provability in \(\mathsf{RCA}\)
- 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
- 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
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)
