arXiv Analytics

Sign in

arXiv:1608.08246 [math.LO]AbstractReferencesReviewsResources

Relations between randomness deficiencies

Gleb Novikov

Published 2016-08-29Version 1

The notion of random sequence was introduced by Martin-Loef in 1966. At the same time he defined the so-called randomness deficiency function that shows how close are random sequences to non-random (in some natural sense). Other deficiency functions can be obtained from the Levin-Schnorr theorem, that describes randomness in terms of Kolmogorov complexity. The difference between all of these deficiencies is bounded by a logarithmic term. In this paper we show that the difference between some deficiencies can be as large as possible.

Related articles: Most relevant | Search more
arXiv:1301.3392 [math.LO] (Published 2013-01-15)
The axiomatic power of Kolmogorov complexity
arXiv:0901.3933 [math.LO] (Published 2009-01-26, updated 2014-08-10)
Kolmogorov complexity and the Recursion Theorem
arXiv:2505.02726 [math.LO] (Published 2025-05-05)
Kolmogorov Complexity of Attractive Degrees