pith. sign in

arxiv: 0912.1072 · v2 · pith:HVT3X6TDnew · submitted 2009-12-06 · 🧮 math.LO · cs.LO· cs.PL· math.PR· math.ST· stat.ML· stat.TH

Computable de Finetti measures

classification 🧮 math.LO cs.LOcs.PLmath.PRmath.STstat.MLstat.TH
keywords computableexchangeablefinettiprovealongautomaticallyconsequencedistribution
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.