Assume that a tuple of binary strings $$ \bar a $$ = 〈a 1 ..., a n 〉 has negligible mutual information with another string b. Does this mean that properties of the Kolmogorov complexity of $$ \bar a $$ do not change significantly if we relativize them to b? This question becomes very nontrivial when we try to formalize it. In this paper we investigate this problem for a special class of properties (for properties that can be expressed by an ∃-formula). In particular, we show that a random (conditional on $$ \bar a $$ ) oracle b does not help to extract common information from the strings a i .
Problems of Information Transmission – Springer Journals
Published: Apr 23, 2010
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud