Computability on computable metric spaces

DOI10.1016/0304-3975(93)90001-AzbMATH Open0783.03023MaRDI QIDQ1802069FDOQ1802069

Authors: Klaus Weihrauch 

Publication date: 20 March 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 1222103
• scientific article; zbMATH DE number 2013199
• scientific article; zbMATH DE number 1101599
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions
• scientific article; zbMATH DE number 1088270

zbMATH Keywords

continuous functionscomputationally admissible representations of metric spacesType 2 theory of effectivity

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Higher-type and set recursion theory (03D65)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computational complexity of real functions
• Processes and the denotational semantics of concurrency
• Compactness in constructive analysis revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Theory of representations
• Title not available (Why is that?)
• Recursive metric spaces
• Title not available (Why is that?)
• Embedding metric spaces into CPO's
• Representations of the real numbers and of the open subsets of the set of real numbers
• Type 2 recursion theory
• Title not available (Why is that?)
• On the complexity of online computations of real functions
• Type 2 computational complexity of functions on Cantor's space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (72)

• Absolutely non-computable predicates and functions in analysis
• Computable approximations of a chainable continuum with a computable endpoint
• When series of computable functions with varying domains are computable
• Title not available (Why is that?)
• Computability of Subsets of Metric Spaces
• On the complexity of the theory of a computably presented metric structure
• Complexity profiles and generic Muchnik reducibility
• Computability of co-regular subsets on metric spaces
• Title not available (Why is that?)
• Equivalences between learning of data and probability distributions, and their applications
• Effective metric spaces and representations of the reals.
• Effective properties of sets and functions in metric spaces with computability structure
• Computable elements and functions in effectively enumerable topological spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability on the probability measures on the Borel sets of the unit interval
• Reducibility of computable metrics on the real line
• On Computable Metrization
• Outline of partial computability in computable topology
• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Randomness on computable probability spaces -- a dynamical point of view
• Positive predicate structures for continuous data
• Title not available (Why is that?)
• Computable Banach spaces via domain theory
• Representations versus numberings: On the relationship of two computability notions
• Computable invariance
• Effective continuities on effective topological spaces
• Elementary computable topology
• Computability on subsets of metric spaces.
• On images of partial computable functions over computable Polish spaces
• Spaces allowing Type‐2 Complexity Theory revisited
• Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
• Effectiveness of the global modulus of continuity on metric spaces
• From axiomatics to intrinsic characterization: some open problems in computable analysis
• MAXIMAL COMPUTABILITY STRUCTURES
• Computability of probability measures and Martin-Löf randomness over metric spaces
• Recursive characterization of computable real-valued functions and relations
• Computability of products of chainable continua
• Recursion and topology on \(2^{\leq\omega}\) for possibly infinite computations
• On the computability of Walsh functions.
• Computability on the probability measures on the Borel sets of the unit interval
• Title not available (Why is that?)
• Computability of pseudo-cubes
• Computable subcontinua of semicomputable chainable Hausdorff continua
• Chainable and circularly chainable semicomputable sets in computable topological spaces
• Computability of Self-Similar Sets
• Computability on measurable functions
• Computability on Regular Subsets of Euclidean Space
• On computably locally compact Hausdorff spaces
• Effectivity on Continuous Functions in Topological Spaces
• Quantitative continuity and Computable Analysis in Coq
• How constructive is constructing measures?
• A Real Number Structure that is Effectively Categorical
• Title not available (Why is that?)
• Complexity of Blowup Problems
• Dense computability structures
• Borel Complexity of Topological Operations on Computable Metric Spaces
• Towards a descriptive set theory for domain-like structures
• Computability on Subsets of Locally Compact Spaces
• Computable neighbourhoods of points in semicomputable manifolds
• Semicomputable manifolds in computable topological spaces
• Extended admissibility.
• Degrees of unsolvability of continuous functions
• Effectivity and effective continuity of multifunctions
• Computably Isometric Spaces
• Warsaw discs and semicomputability
• Computability of graphs
• The Hausdorff-Ershov hierarchy in Euclidean spaces
• An effective Riemann Mapping Theorem
• Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
• Computational complexity on computable metric spaces
• Recursive quasi-metric spaces.

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)