Non-algorithmic theory of randomness
From MaRDI portal
Publication:6326352
DOI10.1007/978-3-030-48006-6_21arXiv1910.00585MaRDI QIDQ6326352FDOQ6326352
Authors: Vladimir Vovk 
Publication date: 1 October 2019
Abstract: This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical results, in principle, applicable in practice. Our main testing ground for the proposed language is the problem of defining Bernoulli sequences, which was of great interest to Andrei Kolmogorov and his students.
This page was built for publication: Non-algorithmic theory of randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6326352)
