Computable de Finetti measures
From MaRDI portal
Abstract: We prove a computable version of de Finetti's theorem on exchangeable sequences of real random variables. As a consequence, exchangeable stochastic processes expressed in probabilistic functional programming languages can be automatically rewritten as procedures that do not modify non-local state. Along the way, we prove that a distribution on the unit interval is computable if and only if its moments are uniformly computable.
Recommendations
Cites work
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 3862208 (Why is no real title available?)
- scientific article; zbMATH DE number 5309069 (Why is no real title available?)
- scientific article; zbMATH DE number 3896009 (Why is no real title available?)
- scientific article; zbMATH DE number 3784087 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 3514749 (Why is no real title available?)
- scientific article; zbMATH DE number 3615887 (Why is no real title available?)
- scientific article; zbMATH DE number 1219014 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1746049 (Why is no real title available?)
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- scientific article; zbMATH DE number 774881 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A convenient category of domains
- A tutorial on computable analysis
- Admissible representations for probability measures
- Computability on continuous, lower semi-continuous and upper semi-continuous real functions
- Computability on random variables
- Computability on subsets of metric spaces.
- Computability on the probability measures on the Borel sets of the unit interval
- Computable exchangeable sequences have computable de Finetti measures
- Computable metrization
- Computing over the reals: foundations for scientific computing.
- Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
- Graph limits and exchangeable random graphs
- Induction and recursion on the partial real line with applications to Real PCF
- LCF considered as a programming language
- On exchangeable random variables and the statistics of large graphs and hypergraphs
- On stationary sequences of random variables and the de Finetti's equivalence
- Probabilistic Symmetries and Invariance Principles
- Recursively enumerable sets and degrees
- Representations for partially exchangeable arrays of random variables
- Representing probability measures using probabilistic processes
- Semi-decidability of may, must and probabilistic testing in a higher-type setting
- Stochastic lambda calculus and monads of probability distributions
- Symmetric Measures on Cartesian Products
- Uses of exchangeability
Cited in
(10)- scientific article; zbMATH DE number 1347865 (Why is no real title available?)
- An application of computable distributions to the semantics of probabilistic programming languages
- Probabilistic computability and choice
- Computable Measure Theory and Algorithmic Randomness
- Computability of probability distributions and characteristic functions
- Computable measures coprojection consistent with ordering relation is not necessarily computable
- Algorithmic barriers to representing conditional independence
- Computable exchangeable sequences have computable de Finetti measures
- Computable randomness and betting for computable probability spaces
- A generalization of hierarchical exchangeability on trees to directed acyclic graphs
This page was built for publication: Computable de Finetti measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q764273)
