Computer Science – Computational Complexity
Scientific paper
2010-06-02
EPTCS 24, 2010, pp. 92-100
Computer Science
Computational Complexity
Scientific paper
10.4204/EPTCS.24.13
In this article we treat a notion of continuity for a multi-valued function F and we compute the descriptive set-theoretic complexity of the set of all x for which F is continuous at x. We give conditions under which the latter set is either a G_\delta set or the countable union of G_\delta sets. Also we provide a counterexample which shows that the latter result is optimum under the same conditions. Moreover we prove that those conditions are necessary in order to obtain that the set of points of continuity of F is Borel i.e., we show that if we drop some of the previous conditions then there is a multi-valued function F whose graph is a Borel set and the set of points of continuity of F is not a Borel set. Finally we give some analogue results regarding a stronger notion of continuity for a multi-valued function. This article is motivated by a question of M. Ziegler in "Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability with Applications to Linear Algebra", (submitted).
No associations
LandOfFree
The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The descriptive set-theoretic complexity of the set of points of continuity of a multi-valued function (Extended Abstract) will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-512931