|
|||||
|
|
A note on Kolmogorov complexity and entropy |
|
| Affiliation: | Department of Mathematical Information Science Tokyo University of Science 1-3 Kagurazaka, Shinjuku-ku Tokyo, 162-8601, Japan |
| Abstract: | It is shown that the Kolmogorov complexity per symbol of an n-sequence from a stationary ergodic source of finite alphabet approaches the entropy rate of the source in probability as n becomes large. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |