On computability and disintegration

DOI10.1017/S0960129516000098zbMath1423.03251arXiv1509.02992MaRDI QIDQ4593233

Daniel M. Roy, Nathanael Leedom Ackerman, Cameron E. Freer

Publication date: 22 November 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Probability measures on topological spaces (60B05) Constructive and recursive analysis (03F60) Integration and disintegration of measures (28A50) Computation over the reals, computable analysis (03D78)

Related Items (5)

Lipschitz continuity of probability kernels in the optimal transport framework ⋮ Discrete-type approximations for non-Markovian optimal stopping problems. II ⋮ On uniform continuity of posterior distributions ⋮ Bayesian Probabilistic Numerical Methods ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Bolzano-Weierstrass theorem is the jump of weak Kőnig's lemma
• Conditional distributions as derivatives
• Probabilistic computability and choice
• Computability of probability measures and Martin-Löf randomness over metric spaces
• 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
• Effectivity in Spaces with Admissible Multirepresentations
• Admissible representations for probability measures
• On the topological aspects of the theory of represented spaces

This page was built for publication: On computability and disintegration