期刊
THEORETICAL COMPUTER SCIENCE
卷 856, 期 -, 页码 14-20出版社
ELSEVIER
DOI: 10.1016/j.tcs.2020.12.003
关键词
Mutual information; Conservation inequalities; Kolmogorov complexity
资金
- Russian Science Foundation [20-11-20203]
- RFBR [19-01-00563]
- Russian Science Foundation [20-11-20203] Funding Source: Russian Science Foundation
In this paper, we consider Levin's notion of mutual information in infinite 0-1-sequences and prove the probabilistic conservation inequality. Additionally, we provide brief proofs of other properties of this notion for completeness.
In this paper we consider Levin's notion of mutual information in infinite 0-1-sequences, as defined in Levin (1974) [6]. The respective information conservation inequalities were stated in that paper without proofs. Later some proofs appeared in the literature, however no proof of the probabilistic conservation inequality has been published yet. In this paper we prove that inequality and for the sake of completeness we present also short proofs of other properties of the said notion. (C) 2020 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据