Relating and contrasting plain and prefix Kolmogorov complexity (Q285520)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6582468
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relating and contrasting plain and prefix Kolmogorov complexity |
scientific article; zbMATH DE number 6582468 |
Statements
Relating and contrasting plain and prefix Kolmogorov complexity (English)
0 references
19 May 2016
0 references
Kolmogorov complexity
0 references
Martin-Löf randomness
0 references
2-randomness
0 references
randomness deficiency
0 references
infinitely often \(C\) and \(K\)-trivial sequences
0 references
0 references
0 references
0.848893404006958
0 references
0.8461629748344421
0 references
0.8255913853645325
0 references
0.7966942191123962
0 references
0.7966942191123962
0 references
