Freer, CE and Roy, DM (2012) Computable de Finetti measures. Annals of Pure and Applied Logic, 163. pp. 530-546. ISSN 0168-0072Full text not available from this repository.
We prove a computable version of the de Finetti 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. © 2011 Elsevier B.V..
|Divisions:||Div F > Computational and Biological Learning|
|Depositing User:||Cron job|
|Date Deposited:||16 Jul 2015 13:06|
|Last Modified:||12 Oct 2015 05:23|