Admissible representations for probability measures

DOI10.1002/malq.200710010zbMath1124.03019OpenAlexW2143225908MaRDI QIDQ5307610

Matthias Schröder

Publication date: 17 September 2007

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.200710010

zbMATH Keywords

measure theoryadmissibilityprobabilistic processestype-2 theory of effectivity

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Set functions and measures on topological spaces (regularity of measures, etc.) (28C15) Theory of numerations, effectively presented structures (03D45) Higher-type and set recursion theory (03D65)

Related Items

Effective aspects of Hausdorff and Fourier dimension ⋮ On computability and disintegration ⋮ Characterization of Kurtz randomness by a differentiation theorem ⋮ How constructive is constructing measures? ⋮ Are unbounded linear operators computable on the average for Gaussian measures? ⋮ Computable Riesz Representation for Locally Compact Hausdorff Spaces ⋮ Computable Exchangeable Sequences Have Computable de Finetti Measures ⋮ An Application of Martin-Löf Randomness to Effective Probability Theory ⋮ Algorithmic randomness over general spaces ⋮ On the topological aspects of the theory of represented spaces ⋮ An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages ⋮ Unnamed Item ⋮ Computability of the Radon-Nikodym Derivative ⋮ Computable randomness and betting for computable probability spaces ⋮ Computable de Finetti measures ⋮ Unnamed Item ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

• Continuous Lattices and Domains
• Introdction to Measure and Probability
• Unnamed Item
• Unnamed Item
• Unnamed Item