DeepAI AI Chat
Log In Sign Up

Proofs of conservation inequalities for Levin's notion of mutual information of 1974

11/13/2019
by   Nikolay Vereshchagin, et al.
0

In this paper we consider Levin's notion of mutual information in infinite 0-1-sequences, as defined in [Leonid Levin. Laws of Information Conservation (Nongrowth) and Aspects of the Foundation of Probability Theory. Problems of information transmission, vol. 10 (1974), pp. 206–211]. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/12/2021

A Reverse Jensen Inequality Result with Application to Mutual Information Estimation

The Jensen inequality is a widely used tool in a multitude of fields, su...
05/14/2020

A new technique for preserving conservation laws

In this paper we introduce a new symbolic-numeric strategy to obtain sem...
03/25/2021

Directed Data-Processing Inequalities for Systems with Feedback

We present novel data-processing inequalities relating the mutual inform...
08/09/2018

Algorithmic No-Cloning Theorem

We introduce the notions of algorithmic mutual information and rarity of...
10/14/2022

On Triangular Inequality of the Discounted Least Information Theory of Entropy (DLITE)

The Discounted Least Information Theory of Entropy (DLITE) is a new info...
09/01/2021

New Proofs of Extremal Inequalities With Applications

The extremal inequality approach plays a key role in network information...
03/13/2023

On the Algorithmic Information Between Probabilities

We extend algorithmic conservation inequalities to probability measures....