Recommendations
Cites work
- scientific article; zbMATH DE number 3145228 (Why is no real title available?)
- scientific article; zbMATH DE number 3871350 (Why is no real title available?)
- scientific article; zbMATH DE number 3926913 (Why is no real title available?)
- scientific article; zbMATH DE number 3952751 (Why is no real title available?)
- scientific article; zbMATH DE number 3987247 (Why is no real title available?)
- scientific article; zbMATH DE number 4023258 (Why is no real title available?)
- scientific article; zbMATH DE number 4051615 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 17564 (Why is no real title available?)
- scientific article; zbMATH DE number 3255438 (Why is no real title available?)
- scientific article; zbMATH DE number 3200656 (Why is no real title available?)
- Compactness in constructive analysis revisited
- Computational complexity of real functions
- Embedding metric spaces into CPO's
- On the complexity of online computations of real functions
- Processes and the denotational semantics of concurrency
- Recursive metric spaces
- Representations of the real numbers and of the open subsets of the set of real numbers
- Theory of representations
- Type 2 computational complexity of functions on Cantor's space
- Type 2 recursion theory
Cited in
(85)- Recursive quasi-metric spaces.
- Computational complexity on computable metric spaces
- Absolutely non-computable predicates and functions in analysis
- Effectivity on continuous functions in topological spaces
- Computable approximations of a chainable continuum with a computable endpoint
- Equivalences between learning of data and probability distributions, and their applications
- When series of computable functions with varying domains are computable
- Effective metric spaces and representations of the reals.
- Effective properties of sets and functions in metric spaces with computability structure
- scientific article; zbMATH DE number 7703272 (Why is no real title available?)
- Computable elements and functions in effectively enumerable topological spaces
- scientific article; zbMATH DE number 800363 (Why is no real title available?)
- scientific article; zbMATH DE number 908753 (Why is no real title available?)
- Computability of Subsets of Metric Spaces
- Computable analysis and notions of continuity in \textsc{Coq}
- Computability on the probability measures on the Borel sets of the unit interval
- Reducibility of computable metrics on the real line
- Complexity of blowup problems (extended abstract)
- Outline of partial computability in computable topology
- Effective dispersion in computable metric spaces
- Computability on subsets of Euclidean space. I: Closed and compact subsets
- On a metric generalization of the \(tt\)-degrees and effective dimension theory
- Randomness on computable probability spaces -- a dynamical point of view
- Computable Banach spaces via domain theory
- scientific article; zbMATH DE number 1746044 (Why is no real title available?)
- Computable invariance
- Positive predicate structures for continuous data
- Effective continuities on effective topological spaces
- Moschovakis extension of represented spaces
- Representations versus numberings: On the relationship of two computability notions
- Computability on subsets of metric spaces.
- On images of partial computable functions over computable Polish spaces
- Elementary computable topology
- Spaces allowing Type‐2 Complexity Theory revisited
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Computability of chainable graphs
- Effectiveness of the global modulus of continuity on metric spaces
- From axiomatics to intrinsic characterization: some open problems in computable analysis
- On the complexity of the theory of a computably presented metric structure
- Recursive characterization of computable real-valued functions and relations
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
- Computability of products of chainable continua
- On the computability of Walsh functions.
- Complexity profiles and generic Muchnik reducibility
- Computable approximations of semicomputable graphs
- Computability of pseudo-cubes
- Computability on the probability measures on the Borel sets of the unit interval
- scientific article; zbMATH DE number 1746049 (Why is no real title available?)
- Computable subcontinua of semicomputable chainable Hausdorff continua
- Chainable and circularly chainable semicomputable sets in computable topological spaces
- A comparison of concepts from computable analysis and effective descriptive set theory
- Computability of Self-Similar Sets
- Computability on measurable functions
- Computability of co-regular subsets on metric spaces
- Computable subcontinua of circularly chainable continua
- On computable metrization
- Computable type of certain quotient spaces
- Computability on Regular Subsets of Euclidean Space
- Complexity of inversion of functions on the reals
- On computably locally compact Hausdorff spaces
- How constructive is constructing measures?
- Quantitative continuity and Computable Analysis in Coq
- A Real Number Structure that is Effectively Categorical
- scientific article; zbMATH DE number 1746033 (Why is no real title available?)
- Decision problems for systems of language equations and inequations
- Maximal computability structures
- Dense computability structures
- Towards a descriptive set theory for domain-like structures
- Borel Complexity of Topological Operations on Computable Metric Spaces
- Moschovakis extension of multi-represented spaces
- Computable neighbourhoods of points in semicomputable manifolds
- A simple and powerful approach for studying constructivity, computability, and complexity
- Semicomputable manifolds in computable topological spaces
- Extended admissibility.
- Computability on Subsets of Locally Compact Spaces
- Degrees of unsolvability of continuous functions
- Approximation systems for functions in topological and in metric spaces
- Effectivity and effective continuity of multifunctions
- Warsaw discs and semicomputability
- Computably Isometric Spaces
- The Hausdorff-Ershov hierarchy in Euclidean spaces
- An effective Riemann Mapping Theorem
- Computability of graphs
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
This page was built for publication: Computability on computable metric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802069)
