Exact expressions for some randomness tests

Abstract

For a computable probability distribution P over the set of infinite binary sequences Martin-Löf defined a test d(x|P) measuring the degree of nonrandomness of the sequence x with respect of P. We give some expressions in terms of Kolmogorov's and other complexities of the initial segments of x whose difference from d(x|P) is bounded by a constant.