Computable de Finetti measures
Freer, Cameron E., Roy, Daniel M.
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.
Dec-19-2011
- Country:
- Europe (0.67)
- North America > United States
- Massachusetts (0.14)
- Genre:
- Research Report (0.50)
- Technology: