Abstract
Assume a tuple of words x ̄ = 〈 x1, ⋯, x n〉 has negligible mutual information with another word y. Does this mean that properties of Kolmogorov complexity for x ̄ do not change significantly if we relativize them conditional to y ? This question becomes very nontrivial when we try to formalize it. We investigate this question for a very particular kind of properties: we show that a random (conditional to x ̄) oracle y cannot help extract the mutual information from x i 's. © 2008 Springer-Verlag Berlin .Heidelberg.
Cite
CITATION STYLE
Muchnik, A., & Romashchenko, A. (2008). A random oracle does not help extract the mutual information. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5162 LNCS, pp. 527–538). https://doi.org/10.1007/978-3-540-85238-4_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
