Computability of Probability Distributions and Characteristic Functions
Computability of Probability Distributions and Characteristic Functions
As a part of our works on effective properties of probability distributions, we deal with the corresponding characteristic functions. A sequence of probability distributions is computable if and only if the corresponding sequence of characteristic functions is computable. As for the onvergence problem, the effectivized Glivenko's theorem holds. Effectivizations of …