Computable de Finetti measures

From MaRDI portal
Publication:764273

DOI10.1016/J.APAL.2011.06.011zbMATH Open1247.03098arXiv0912.1072OpenAlexW2144567031MaRDI QIDQ764273FDOQ764273


Authors: Cameron E. Freer, Daniel M. Roy Edit this on Wikidata


Publication date: 13 March 2012

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0912.1072




Recommendations




Cites Work


Cited In (10)

Uses Software





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)