Muchnik's conditional theorem
GPTKB entity
Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
gptkb:Kolmogorov_complexity
conditional complexity |
| gptkbp:field |
algorithmic information theory
|
| gptkbp:namedAfter |
gptkb:Andrey_Muchnik
|
| gptkbp:publishedIn |
Theoretical Computer Science
|
| gptkbp:relatedTo |
information distance
symmetry of information |
| gptkbp:state |
For any strings x and y, there exists a string p such that the conditional Kolmogorov complexity K(p|x) is small, and K(y|p) is close to K(y|x).
|
| gptkbp:yearProposed |
1998
|
| gptkbp:bfsParent |
gptkb:Muchnik's_theorem
|
| gptkbp:bfsLayer |
8
|
| https://www.w3.org/2000/01/rdf-schema#label |
Muchnik's conditional theorem
|