On computability and disintegration
From MaRDI portal
Publication:4593233
Abstract: We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration, is strongly Weihrauch equivalent to the limit operator Lim. When a measure does not have a unique continuous disintegration, we may still obtain a disintegration when some basis of continuity sets has the Vitali covering property with respect to the measure; the disintegration, however, may depend on the choice of sets. We show that, when the basis is computable, the resulting disintegration is strongly Weihrauch reducible to Lim, and further exhibit a single distribution realizing this upper bound.
Recommendations
Cites work
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 5309069 (Why is no real title available?)
- scientific article; zbMATH DE number 3707455 (Why is no real title available?)
- scientific article; zbMATH DE number 1047996 (Why is no real title available?)
- scientific article; zbMATH DE number 3438120 (Why is no real title available?)
- scientific article; zbMATH DE number 1969324 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 897216 (Why is no real title available?)
- Admissible representations for probability measures
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Conditional distributions as derivatives
- Effective Borel measurability and reducibility of functions
- Effective Choice and Boundedness Principles in Computable Analysis
- Effectivity in Spaces with Admissible Multirepresentations
- On the topological aspects of the theory of represented spaces
- Probabilistic computability and choice
- Synthetic topology: of data types and classical spaces
- The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
- Uniform test of algorithmic randomness over a general space
- Weihrauch degrees, omniscience principles and weak computability
Cited in
(8)- Discrete-type approximations for non-Markovian optimal stopping problems. II
- scientific article; zbMATH DE number 421685 (Why is no real title available?)
- Disintegration of projective measures
- Lipschitz continuity of probability kernels in the optimal transport framework
- Computable Measure Theory and Algorithmic Randomness
- Bayesian Probabilistic Numerical Methods
- On uniform continuity of posterior distributions
- Warsaw discs and semicomputability
This page was built for publication: On computability and disintegration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4593233)