Universal computably enumerable sets and initial segment prefix-free complexity (Q391648): Difference between revisions
From MaRDI portal
Latest revision as of 05:53, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Universal computably enumerable sets and initial segment prefix-free complexity |
scientific article |
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