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 ofprobability distributions is computable if and only if the correspondingsequence of characteristic functions is computable. As for the onvergenceproblem, the effectivized Glivenko's theorem holds. Effectivizations ofBochner's theorem and de Moivre-Laplace central limit theorem are also proved