Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)'' (Q5958283): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57349836, #quickstatements; #temporary_batch_1710970253704 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4079503 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Inequalities for Shannon entropy and Kolmogorov complexity / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4337021 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On common information / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Pairs of words with nonmaterializable mutual information / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On degrees of unsolvability / rank | |||
Normal rank | |||
Revision as of 22:21, 3 June 2024
scientific article; zbMATH DE number 1715284
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)'' |
scientific article; zbMATH DE number 1715284 |
Statements
Upper semi-lattice of binary strings with the relation ``\(x\) is simple conditional to \(y\)'' (English)
0 references
3 March 2002
0 references
Kolmogorov complexity
0 references
common information
0 references
conditional complexity
0 references
