Computability on the probability measures on the Borel sets of the unit interval
From MaRDI portal
Publication:1292415
DOI10.1016/S0304-3975(98)00298-9zbMATH Open0916.68043WikidataQ126843235 ScholiaQ126843235MaRDI QIDQ1292415FDOQ1292415
Authors: Klaus Weihrauch
Publication date: 21 June 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Domain theory and integration
- Power domains and iterated function systems
- Computable functionals
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of representations
- Computability on computable metric spaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Konstruktive Darstellungen in Topologischen Räumen mit Rekursiver Basis
Cited In (27)
- Computability on random events and variables in a computable probability space
- Computability of measurable sets via effective topologies
- When series of computable functions with varying domains are computable
- Representing probability measures using probabilistic processes
- On the topological aspects of the theory of represented spaces
- A computable approach to measure and integration theory
- Notions of Probabilistic Computability on Represented Spaces
- Computability of probability distributions and distribution functions
- Computable Riesz representation for locally compact Hausdorff spaces
- Computability on random variables
- Algorithmic randomness over general spaces
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Admissible representations of probability measures
- A computable version of the Daniell-Stone theorem on integration and linear functionals
- Title not available (Why is that?)
- An Application of Computable Distributions to the Semantics of Probabilistic Programming Languages
- Computable Measure Theory and Algorithmic Randomness
- Computability on measurable functions
- Computable de Finetti measures
- Uncomputably noisy ergodic limits
- On the computability of a construction of Brownian motion
- Kolmogorov complexity and the geometry of Brownian motion
- Random elements in effective topological spaces with measure.
- Computable exchangeable sequences have computable de Finetti measures
- Computability of the Radon-Nikodym derivative
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem
- Are unbounded linear operators computable on the average for Gaussian measures?
This page was built for publication: Computability on the probability measures on the Borel sets of the unit interval
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292415)