Statements (13)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:Levin's_optimality_theorem
|
| gptkbp:appliesTo |
prefix-free Turing machines
|
| gptkbp:field |
algorithmic information theory
|
| https://www.w3.org/2000/01/rdf-schema#label |
Levin's theorem
|
| gptkbp:namedAfter |
gptkb:Leonid_Levin
|
| gptkbp:publishedIn |
gptkb:Problems_of_Information_Transmission
|
| gptkbp:relatedTo |
gptkb:Kolmogorov_complexity
|
| gptkbp:significance |
establishes the existence of a universal description method for prefix complexity
|
| gptkbp:state |
There exists an optimal universal prefix Turing machine for which the prefix Kolmogorov complexity is minimal up to an additive constant.
|
| gptkbp:yearProposed |
1974
|
| gptkbp:bfsParent |
gptkb:NP-completeness
|
| gptkbp:bfsLayer |
5
|