Abstract
We show that a single application of the non-computable operator EC, which transforms enumerations of sets (in ℕ) to their characteristic functions, suffices to compute the Radon-Nikodym derivative dμ/ dλ of a finite measure μ, which is absolutely continuous w.r.t. the σ-finite measure λ. We also give a condition on the two measures (in terms of computability of the norm of a certain linear operator involving the two measures) which is sufficient to compute the derivative.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brattka, V., de Brecht, M., Pauly, A.: Closed choice and a uniform low basis theorem. arXiv:1002.2800v1 [math.LO] (February 14. 2010)
Brattka, V., Gherardi, G.: Effective choice and boundedness principles in computable analysis. Bulletin of Symbolic Logic 17(1), 73–117 (2011)
Brattka, V., Gherardi, G.: Weihrauch degrees, omniscience principles and weak computability. Journal of Symbolic Logic 76, 143–176 (2011)
Bogachev, V.I.: Measure Theory. Springer, Heidelberg (2006)
Brattka, V.: Effective Borel measurability and reducibility of functions. Mathematical Logic Quarterly 51(1), 19–44 (2005)
Dudley, R.: Real Analysis and Probability, 2nd edn. Cambridge University Press, Cambridge (2002)
Gács, P.: Uniform test of algorithmic randomness over a general space. Theoretical Computer Science 341, 91–137 (2005)
Galatolo, S., Hoyrup, M., Rojas, C.: A constructive Borel-Cantelli lemma. constructing orbits with required statistical properties. Theoretical Computer Science 410(21-23), 2207–2222 (2009)
Gherardi, G., Marcone, A.: How incomputable is the separable Hahn-Banach theorem? Notre Dame Journal of Formal Logic 50(4), 293–425 (2009)
Hoyrup, M., Rojas, C.: Computability of probability measures and martin-löf randomness over metric spaces. Information and Computation 207(7), 830–847 (2009)
Hoyrup, M., Rojas, C., Weihrauch, K.: The Radon-Nikodym operator is not computable. In: CCA 2011 (2011)
Rudin, W.: Real and Complex Analysis, 3rd edn. McGraw-Hill, New York (1987)
Schröder, M.: Admissible representations for probability measures. Mathematical Logic Quarterly 53(4–5), 431–445 (2007)
Schröder, M., Simpson, A.: Representing probability measures using probabilistic processes. Journal of Complexity 22(6), 768–782 (2006)
Simpson, S.G.: Subsystems of Second Order Arithmetic. Perspectives in Mathematical Logic. Springer, Berlin (1999)
Weihrauch, K.: The degrees of discontinuity of some translators between representations of the real numbers. Technical Report TR-92-050, International Computer Science Institute, Berkeley (July 1992)
Weihrauch, K.: The degrees of discontinuity of some translators between representations of the real numbers. Informatik Berichte 129, FernUniversität Hagen, Hagen (July 1992)
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. Springer, Berlin (2000)
Wu, Y., Weihrauch, K.: A computable version of the Daniell-Stone theorem on integration and linear functionals. Theoretical Computer Science 359(1–3), 28–42 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoyrup, M., Rojas, C., Weihrauch, K. (2011). Computability of the Radon-Nikodym Derivative. In: Löwe, B., Normann, D., Soskov, I., Soskova, A. (eds) Models of Computation in Context. CiE 2011. Lecture Notes in Computer Science, vol 6735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21875-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-21875-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21874-3
Online ISBN: 978-3-642-21875-0
eBook Packages: Computer ScienceComputer Science (R0)