Computability on random events and variables in a computable probability space
From MaRDI portal
Publication:690479
DOI10.1016/J.TCS.2012.06.027zbMath1271.03064OpenAlexW2029506029MaRDI QIDQ690479
Publication date: 27 November 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.06.027
random variablescomputability of integrationcomputable probability spacemultirepresentationrandom eventsrecursive completeness
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domain theory and integration
- Computability of measurable sets via effective topologies
- Representing probability measures using probabilistic processes
- A computable approach to measure and integration theory
- The constructive Radon-Nikodym theorem
- Computability on random variables
- Computability on the probability measures on the Borel sets of the unit interval
- Notes on constructive probability theory
- A computable version of the Daniell-Stone theorem on integration and linear functionals
- A constructive study of measure theory
- Filter spaces and continuous functionals
- Topological and limit-space subcategories of countably-based equilogical spaces
- Spaces in which sequences suffice
- On Sequential Convergence
- Constructive measure theory
- Computability of measurable sets via effective metrics
- On the combination of topologies
This page was built for publication: Computability on random events and variables in a computable probability space
