A. Kato, Kolmogorov Complexity with Cost and the Randomness, Doctorial Thesis, The University of Electro-Communications (1997).  Home/Search   Document Not in Database   Summary   Related Articles

.... 1 We say j : C [0; 1] is a probability measure over C if j( 1 ; j(x) X y2C j(xy) for 8x 2 C : In particular, j is said to be regular if there exist constants d 1 ; d 2 (0 d 1 d 2 1) such that for 8x 2 C and 8y 2 C d 1 Gamma log j(xy) log j(x) d 2 Lemma 1 (Kato[4]) Let j : C [0; 1] be a regular probability measure, and S a finite or countable set. We consider the set fc(oe) 0 : oe 2 Sg such that X oe2S c(oe) 1 : 6) Then, there exists a prefix set fv(oe) 2 C : oe 2 Sg such that j(v(oe) Gamma log c(oe) K (7) for 9K. Lemma 2 ....

A. Kato, Kolmogorov Complexity with Cost and the Randomness, Doctorial Thesis, The University of Electro-Communications (1997).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC