Upper semi-lattice of binary strings with the relation "x is simple conditional to y"

Theoretical Computer Science

Volumn 271, Issue 1-2, 2002, Pages 69-95

  Chernov, Alexei ^a   Muchnik, Andrej ^b   Romashchenko, Andrei ^a   Shen, Alexander ^c   Vereshchagin, Nikolai ^a  

^a MOSCOW STATE UNIVERSITY   (Russian Federation)

^b RUSSIAN STATE UNIVERSITY FOR THE HUMANITIES   (Russian Federation)

^c INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

Common information; Conditional complexity; Kolmogorov complexity

Indexed keywords

BINARY STRINGS;

ALGEBRA; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; SET THEORY;

TURING MACHINES;

EID: 0037185209     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00032-9     Document Type: Article

References (7)

1. Common information is far less than mutual information
2. Inequalities for Shannon entropies and Kolmogorov complexities
3. On the extraction of common information of two strings
4. On common information
5. Pary slov s nematerialisuemoi vzaimnoi informatsiei (Pairs of strings with no extractable mutual information, in Russian)