Universal computably enumerable sets and initial segment prefix-free complexity (Q391648)
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 6244351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Universal computably enumerable sets and initial segment prefix-free complexity |
scientific article; zbMATH DE number 6244351 |
Statements
Universal computably enumerable sets and initial segment prefix-free complexity (English)
0 references
10 January 2014
0 references
universal sets
0 references
computably enumerable
0 references
Kolmogorov complexity
0 references
initial segment complexity
0 references
0 references
0.8361760973930359
0 references
0.8179104924201965
0 references
0.8000117540359497
0 references
0.7963507771492004
0 references
