# Stability of properties of Kolmogorov complexity under relativization

Stability of properties of Kolmogorov complexity under relativization 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 . http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

# Stability of properties of Kolmogorov complexity under relativization

, Volume 46 (1) – Apr 23, 2010
24 pages

/lp/springer_journal/stability-of-properties-of-kolmogorov-complexity-under-relativization-qC5JSeUFAV
Publisher
SP MAIK Nauka/Interperiodica
Subject
Engineering; Systems Theory, Control; Information Storage and Retrieval; Electrical Engineering; Communications Engineering, Networks
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1134/S0032946010010059
Publisher site
See Article on Publisher Site

### Abstract

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 .

### Journal

Problems of Information TransmissionSpringer Journals

Published: Apr 23, 2010

## You’re reading a free preview. Subscribe to read the entire article.

### DeepDyve is your personal research library

It’s your single place to instantly
that matters to you.

over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month ### Explore the DeepDyve Library ### Search Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly ### Organize Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place. ### Access Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals. ### Your journals are on DeepDyve Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more. All the latest content is available, no embargo periods. DeepDyve ### Freelancer DeepDyve ### Pro Price FREE$49/month
\$360/year

Save searches from
PubMed

Create lists to

Export lists, citations