Computability of probability distributions and characteristic functions
From MaRDI portal
Abstract: 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 Bochner's theorem and de Moivre-Laplace central limit theorem are also proved.
Recommendations
Cited in
(5)- Approximate computation of characteristic functionals of some classes of probability measures
- Computability of probability distributions and distribution functions
- scientific article; zbMATH DE number 4033078 (Why is no real title available?)
- scientific article; zbMATH DE number 1347865 (Why is no real title available?)
- Computer Science for Continuous Data
This page was built for publication: Computability of probability distributions and characteristic functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2846581)