CT-1997-04: Muchnik, Andrei and Romashchenko, Andrei and Shen, Alexander and Vereshagin, Nikolai (1997) Upper Semi-Lattice of Binary Strings with the Relation ``$x$ is simple conditional to $y$''. [Report]
![[thumbnail of Full Text]](https://eprints.illc.uva.nl/style/images/fileicons/text.png) |
Text (Full Text)
CT-1997-04.text.ps.gz Download (67kB) |
|
Text (Abstract)
CT-1997-04.abstract.txt Download (581B) |
Abstract
Upper semilattice of binary strings with the relation
``x is simple conditional to y''
Andrei Muchnik, Andrei Romashchenko, Alexander Shen, Nikolai Vereshagin
We study the properties of the set of binary strings with the relation
``the Kolmogorov complexity of x conditional to y is small''. We prove that
there are pairs of strings which have no greatest common lower bound with
respect to this preorder. We present several examples when the greatest
common lower bound exists but its complexity is much less than mutual
information (extending G'acs and K¨orner result).
| Item Type: | Report |
|---|---|
| Report Nr: | CT-1997-04 |
| Series Name: | Computation and Complexity Theory (CT) |
| Year: | 1997 |
| Date Deposited: | 12 Oct 2016 14:39 |
| Last Modified: | 12 Oct 2016 14:39 |
| URI: | https://eprints.illc.uva.nl/id/eprint/1075 |
Actions (login required)
 |
View Item |
