Notions of Probabilistic Computability on Represented Spaces
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 5309069
- Computability on random events and variables in a computable probability space
- Probabilistic computability and choice
- Computable randomness and betting for computable probability spaces
- Randomness on computable probability spaces -- a dynamical point of view
- Randomness on computable probability spaces -- a dynamical point of view
- Computability of probability measures and Martin-Löf randomness over metric spaces
- Constructive Equivalence Relations on Computable Probability Measures
- Constructive equivalence relations on computable probability measures
- Computability on the probability measures on the Borel sets of the unit interval
Cites work
- A computable version of the Daniell-Stone theorem on integration and linear functionals
- Admissible representations of probability measures
- Computability of measurable sets via effective metrics
- Computability of measurable sets via effective topologies
- Computability on random variables
- Computability on the probability measures on the Borel sets of the unit interval
- Domain theory and integration
- Extended admissibility.
- Finite approximation of measure and integration
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 52121 (Why is no real title available?)
- scientific article; zbMATH DE number 193549 (Why is no real title available?)
- scientific article; zbMATH DE number 193625 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- On computable metrization
- Representing probability measures using probabilistic processes
- Three concepts of decidability for general subsets of uncountable spaces
- Undecidability in Rn: Riddled Basins, the KAM Tori, and the Stability of the Solar System
- Uniform test of algorithmic randomness over a general space
Cited in
(12)- Constructive equivalence relations on computable probability measures
- Effective symbolic dynamics, random points, statistical behavior, complexity and entropy
- Computability on the probability measures on the Borel sets of the unit interval
- Probabilistic computability and choice
- Computability of probability distributions and characteristic functions
- Computability of probability distributions and distribution functions
- Computability on measurable functions
- scientific article; zbMATH DE number 5309069 (Why is no real title available?)
- Closed choice and a uniform low basis theorem
- Computability on the probability measures on the Borel sets of the unit interval
- Computability on random events and variables in a computable probability space
- Are unbounded linear operators computable on the average for Gaussian measures?
This page was built for publication: Notions of Probabilistic Computability on Represented Spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918035)