Kolmogorov complexity of enumerating finite sets (Q2379938)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Kolmogorov complexity of enumerating finite sets |
scientific article; zbMATH DE number 5686386
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Kolmogorov complexity of enumerating finite sets |
scientific article; zbMATH DE number 5686386 |
Statements
Kolmogorov complexity of enumerating finite sets (English)
0 references
24 March 2010
0 references
Kolmogorov complexity
0 references
a priori probability
0 references
randomized algorithms
0 references
0.7571464776992798
0 references
0.7507655024528503
0 references
0.7495011687278748
0 references
0.7458854913711548
0 references
