## Abstract The investigation of computational properties of discontinuous functions is an important concern in computable analysis. One method to deal with this subject is to consider effective variants of Borel measurable functions. We introduce such a notion of Borel computability for single‐val
Effective Borel degrees of some topological functions
✍ Scribed by Guido Gherardi
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 287 KB
- Volume
- 52
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
The focus of this paper is the incomputability of some topological functions (with respect to certain representations) using the tools of Borel computability theory, as introduced by V. Brattka in [3] and [4]. First, we analyze some basic topological functions on closed subsets of ℝ^n^ , like closure, border, intersection, and derivative, and we prove for such functions results of Σ^0^~2~‐completeness and Σ^0^~3~‐completeness in the effective Borel hierarchy. Then, following [13], we re‐consider two well‐known topological results: the lemmas of Urysohn and Urysohn‐Tietze for generic metric spaces (for the latter we refer to the proof given by Dieudonné). Both lemmas define Σ^0^~2~‐computable functions which in some cases are even Σ^0^~2~‐complete. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
📜 SIMILAR VOLUMES
The bisection method provides an affirmative answer for scalar functions. We show that the answer is negative for bivariate functions. This means, in particular, that an arbitrary continuation method cannot approximate a zero of every smooth bivariate function with nonzero topological degree. F: 198
Let A D .a ij / n n be an invertible matrix and A 1 D .a ij / n n be the inverse of A. In this paper, we consider the generalized Liouville system (0.1) Ã D 0; i 2 I WD f1; : : : ; ng;
The paper studies the degree of approximation of functions associated with Hardy᎐Littlewood series in the Holder metric.