Computability of the Radon-Nikodym Derivative

DOI10.1007/978-3-642-21875-0_14zbMath1345.03084arXiv1112.2838OpenAlexW1919650993MaRDI QIDQ3091448

Weihrauch, Klaus, Mathieu Hoyrup, Cristobal Rojas

Publication date: 9 September 2011

Published in: Computability, Models of Computation in Context (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.2838

zbMATH Keywords

computable analysisRadon-Nikodym theoremWeihrauch reducibilitycomputable measure theorydegree of non-computability

Mathematics Subject Classification ID

Vector-valued set functions, measures and integrals (28B05) Computation over the reals, computable analysis (03D78)

Related Items (15)

Abstract State Machines with Exact Real Arithmetic ⋮ Computability and Analysis, a Historical Approach ⋮ The Brouwer Fixed Point Theorem Revisited ⋮ On the existence of a connected component of a graph ⋮ On computability and disintegration ⋮ On the uniform computational content of computability theory ⋮ Computability on measurable functions ⋮ Many-one reductions and the category of multivalued functions ⋮ How constructive is constructing measures? ⋮ Pointwise complexity of the derivative of a computable function ⋮ On the algebraic structure of Weihrauch degrees ⋮ Connected choice and the Brouwer fixed point theorem ⋮ Computability of the Radon-Nikodym Derivative ⋮ Computable Measure Theory and Algorithmic Randomness ⋮ Weihrauch Complexity in Computable Analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Closed choice and a uniform low basis theorem
• Representing probability measures using probabilistic processes
• How incomputable is the separable Hahn-Banach theorem?
• A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties
• Computability on the probability measures on the Borel sets of the unit interval
• Computability of probability measures and Martin-Löf randomness over metric spaces
• A computable version of the Daniell-Stone theorem on integration and linear functionals
• Uniform test of algorithmic randomness over a general space
• Weihrauch degrees, omniscience principles and weak computability
• Effective Choice and Boundedness Principles in Computable Analysis
• Computability of the Radon-Nikodym Derivative
• Effective Borel measurability and reducibility of functions
• Real Analysis and Probability
• Admissible representations for probability measures

This page was built for publication: Computability of the Radon-Nikodym Derivative