Computability on continuous, lower semi-continuous and upper semi-continuous real functions

DOI10.1016/S0304-3975(98)00045-0zbMath0944.68058MaRDI QIDQ1575670

Weihrauch, Klaus, Zheng, Xizhong

Publication date: 21 August 2000

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

zbMATH Keywords

computabilitycontinuous real functioneffective analysissemi-continuous real function

Mathematics Subject Classification ID

Related Items

Conservatively Approximable Functions ⋮ Can we compute the similarity between surfaces? ⋮ Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra ⋮ Singular coverings and non‐uniform notions of closed set computability ⋮ Recursive quasi-metric spaces. ⋮ Computability on subsets of metric spaces. ⋮ Singular Coverings and Non-Uniform Notions of Closed Set Computability ⋮ Revising Type-2 Computation and Degrees of Discontinuity ⋮ The Computational Geometry of Comparing Shapes ⋮ Computable de Finetti measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Type 2 recursion theory
• Theory of representations
• Compactness in constructive analysis revisited
• Representations of the real numbers and of the open subsets of the set of real numbers
• Category theory and computer science. 6th international conference, CTCS '95, Cambridge, United Kingdom, August 7--11, 1995. Proceedings
• Introduction to global optimization
• Effective content of the calculus of variations. I: Semi-continuity and the chattering lemma
• Some characterizations of normal and perfectly normal spaces
• Algebraically Generalized Recursive Function Theory