AbstractWe 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
A finite form of de Finetti’s representation theorem is established using elementary information-the...
In the second volume of “An introduction to Probability Theory and Its Applications”, Feller (1966) ...
ii Gábor J. Székely, Advisor The focus of this research was to explore the mathematical uses of si...
We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real ra...
We present a novel proof of de Finetti’s Theorem characterizing permutation-invariant probability me...
We show how to approximate de Finetti's measure of a partially exchangeable sequence by a mixture of...
We show how to approximate de Finetti's measure of a partially exchangeable sequence by a mixture of...
As a part of our works on effective properties of probability distributions,we deal with the corresp...
This entry deals with the de Finetti representation theorem of the law of a sequence of exchangeable...
AbstractThe extended de Finetti theorem characterizes exchangeable infinite sequences of random vari...
The extended de Finetti theorem characterizes exchangeable infinite sequences of random variables as...
The extended de Finetti theorem characterizes exchangeable infinite sequences of random variables as...
22 pages, 1 figureWe introduce a general framework for de Finetti reduction results, applicable to v...
22 pages, 1 figureWe introduce a general framework for de Finetti reduction results, applicable to v...
AbstractWhile computability theory on many countable sets is well established and for computability ...
A finite form of de Finetti’s representation theorem is established using elementary information-the...
In the second volume of “An introduction to Probability Theory and Its Applications”, Feller (1966) ...
ii Gábor J. Székely, Advisor The focus of this research was to explore the mathematical uses of si...
We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real ra...
We present a novel proof of de Finetti’s Theorem characterizing permutation-invariant probability me...
We show how to approximate de Finetti's measure of a partially exchangeable sequence by a mixture of...
We show how to approximate de Finetti's measure of a partially exchangeable sequence by a mixture of...
As a part of our works on effective properties of probability distributions,we deal with the corresp...
This entry deals with the de Finetti representation theorem of the law of a sequence of exchangeable...
AbstractThe extended de Finetti theorem characterizes exchangeable infinite sequences of random vari...
The extended de Finetti theorem characterizes exchangeable infinite sequences of random variables as...
The extended de Finetti theorem characterizes exchangeable infinite sequences of random variables as...
22 pages, 1 figureWe introduce a general framework for de Finetti reduction results, applicable to v...
22 pages, 1 figureWe introduce a general framework for de Finetti reduction results, applicable to v...
AbstractWhile computability theory on many countable sets is well established and for computability ...
A finite form of de Finetti’s representation theorem is established using elementary information-the...
In the second volume of “An introduction to Probability Theory and Its Applications”, Feller (1966) ...
ii Gábor J. Székely, Advisor The focus of this research was to explore the mathematical uses of si...