Computability of the radon-nikodym derivative

18Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures and the integrable functions on such spaces. For functions f, g on represented sets, f is W-reducible to g if f can be computed by applying the function g at most once. Let RN be the Radon-Nikodym operator on the space under consideration and let EC be the non-computable operator mapping every enumeration of a set of natural numbers to its characteristic function. We prove that for every computable measurable space, RN is W-reducible to EC, and we construct a computable measurable space for which EC is W-reducible to RN.

Cite

CITATION STYLE

APA

Hoyrup, M., Rojas, C., & Weihrauch, K. (2012). Computability of the radon-nikodym derivative. Computability, 1(1), 3–13. https://doi.org/10.3233/COM-2012-005

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free