On Computable Metrization

DOI10.1016/j.entcs.2006.08.020zbMath1262.03137MaRDI QIDQ4921450

Weihrauch, Klaus, Tanja Grubba

Publication date: 10 May 2013

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

Full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.020

zbMATH Keywords

computable analysis; computable metric space; computable embedding; TTE; computable metrization

Mathematics Subject Classification ID

54E35: Metric spaces, metrizability

03F60: Constructive and recursive analysis

Related Items

Computable elements and functions in effectively enumerable topological spaces, Unnamed Item, Notions of Probabilistic Computability on Represented Spaces, Effectivity on Continuous Functions in Topological Spaces, COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM, On images of partial computable functions over computable Polish spaces, Rice’s Theorem in Effectively Enumerable Topological Spaces

Cites Work

• Computability on subsets of Euclidean space. I: Closed and compact subsets
• Concrete models of computation for topological algebras
• Effective properties of sets and functions in metric spaces with computability structure
• Computability on subsets of metric spaces.
• Computability on computable metric spaces
• Continuity and computability of reachable sets
• Computable operators on regular sets
• Computable functionals
• Computability theory of generalized functions
• Computability on Regular Subsets of Euclidean Space
• Computable Real‐Valued Functions on Recursive Open and Closed Subsets of Euclidean Space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item