Disjointness of Random Sequence Sets with Respect to Distinct Probability Measures

It is shown that the set of deterministic random sequences (of symbols from a finite alphabet) with respect to a computable probability measure /spl mu/, in Martin-Lof's (1966) sense, and the set of deterministic random sequences with respect to another computable probability measure /spl nu/ are disjoint if /spl mu/ and /spl nu/ are different and the measures are either i.i.d. or homogeneous finite-order irreducible Markov measures.

[1]  Gregory J. Chaitin,et al.  A recent technical report , 1974, SIGA.

[2]  Gregory J. Chaitin,et al.  Algorithmic Information Theory , 1987, IBM J. Res. Dev..

[3]  Per Martin-Löf,et al.  The Definition of Random Sequences , 1966, Inf. Control..

[4]  Gregory. J. Chaitin,et al.  Algorithmic information theory , 1987, Cambridge tracts in theoretical computer science.

[5]  I. Csiszár.  Information Theory , 1981 .

[6]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1997, Texts in Computer Science.

[7]  Giuseppe Longo,et al.  The error exponent for the noiseless encoding of finite ergodic Markov sources , 1981, IEEE Trans. Inf. Theory.

[8]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .