Abstract. Assume a tuple of words x ̄ = 〈x1,..., xn 〉 has negligible mu-tual 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 xi’s.
In this dissertation we consider two different notions of randomness and their applications to probl...
AbstractResource-boundedmeasure as originated by Lutz is an extension of classical measure theory wh...
It is known that the mutual information, in the sense of Kolmogorov complexity, of any pair of strin...
Abstract. Assume a tuple of binary strings a ̄ = 〈a1,..., an 〉 has negligible mutual information wi...
We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic informa...
If a computer is given access to an oracle—the characteristic function of a set whose membership rel...
Abstract. Symmetry of information establishes a relation between the information that x has about y ...
An infinite binary sequence has randomness rate at least $sigma$ if, for almost every $n$, the Kolmo...
ference on Computational Complexity 2008: 321-331] considered com-munication complexity of the follo...
textabstractWe study the set of incompressible strings for various resource bounded versions of Kolm...
We show that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings x...
Abstract. We study the computational complexity of an oracle set using a number of notions of random...
Abstract. One of the main notions of information theory is the notion of mutual information in two m...
The article further develops Kolmogorov's algorithmic complexity theory. The definition of randomnes...
In this dissertation we consider two different notions of randomness and their applica-tions to prob...
In this dissertation we consider two different notions of randomness and their applications to probl...
AbstractResource-boundedmeasure as originated by Lutz is an extension of classical measure theory wh...
It is known that the mutual information, in the sense of Kolmogorov complexity, of any pair of strin...
Abstract. Assume a tuple of binary strings a ̄ = 〈a1,..., an 〉 has negligible mutual information wi...
We explain the basics of the theory of the Kolmogorov complexity}, also known as algorithmic informa...
If a computer is given access to an oracle—the characteristic function of a set whose membership rel...
Abstract. Symmetry of information establishes a relation between the information that x has about y ...
An infinite binary sequence has randomness rate at least $sigma$ if, for almost every $n$, the Kolmo...
ference on Computational Complexity 2008: 321-331] considered com-munication complexity of the follo...
textabstractWe study the set of incompressible strings for various resource bounded versions of Kolm...
We show that the mutual information, in the sense of Kolmogorov complexity, of any pair of strings x...
Abstract. We study the computational complexity of an oracle set using a number of notions of random...
Abstract. One of the main notions of information theory is the notion of mutual information in two m...
The article further develops Kolmogorov's algorithmic complexity theory. The definition of randomnes...
In this dissertation we consider two different notions of randomness and their applica-tions to prob...
In this dissertation we consider two different notions of randomness and their applications to probl...
AbstractResource-boundedmeasure as originated by Lutz is an extension of classical measure theory wh...
It is known that the mutual information, in the sense of Kolmogorov complexity, of any pair of strin...
Add to ORKG