Abstract
We investigate in the frame of TTE the computability of functions of the measurable sets from an infinite computable measure space such as the measure and the four kinds of set operations. We first present a series of undecidability and incomputability results about measurable sets. Then we construct several examples of computable topological spaces from the abstract infinite computable measure space, and analyze the computability of the considered functions via respectively each of the standard representations of the computable topological spaces constructed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bauer, H.: Measure and Integration Theory. Translated from the German by Robert B. Burckel (Walter de Gruyter, Berlin, New York, 2001)
Cohn, D.L.: Measure Theory (Birkhäuser Boston, 1980)
Edalat, A.: Dynamical systems, measures, and fractals via domain theory. Information and Computation 120, 32–48 (1995)
Edalat, A.: Domain and integration. Theoretical Computer Science 151, 163–193 (1995)
Ko, K.-I.: Complexity Theory of Real Functions, Progress in Theoretical Computer Science. Birkhäuser, Boston, 1991
Ko, K.-I.: A polynomial time computable curve whose interior has a nonrecursive measure. Theoretical Computer Science 145, 241–270 (1995)
Ko, K.-I.: On the computability of fractal dimensions and Hausdorff measure. Ann. Pure Appl. Logic 93, 195–216 (1998)
Norbert Th. Müller.: Computability on random variables. Theoretical Computer Science 219, 287–299 (1999)
Schröder, M.: Admissible representations for continuous computations. Informatik Berichte 299, FernUniversität Hagen, Hagen, April 2003. Dissertation
Weihrauch, K.: Type 2 recursion theory. Theoretical Computer Science 38, 17–33 (1985)
Weihrauch, K.: A simple introduction to computable analysis, Informatik Berichte 171, FernUniversität Hagen, 1995
Weihrauch, K.: Computability on the probability measures on the Borel sets of the unit interval. Theoretical Computer Science 219, 421–437 (1999)
Weihrauch, K.: Computable Analysis: an Introduction. (Springer-Verlag, Berlin, Heidelberg, 2000)
Wu, Y.-C., Weihrauch, K.: A computable version of the Daniell-Stone theorem on integration and linear functionals. Submitted to Theoretical Computer Science, 2004
Wu, Y.-C.: Undecidability and incomputability of an infinite measure space. Submitted to Journal of Symbolic Logic, 2005
Author information
Authors and Affiliations
Corresponding author
Additional information
The authors are supported by grants of NSFC and DFG.
Rights and permissions
About this article
Cite this article
Wu, Y., Ding, D. Computability of measurable sets via effective topologies. Arch. Math. Logic 45, 365–379 (2006). https://doi.org/10.1007/s00153-005-0315-x
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00153-005-0315-x