Kolmogorov's complexity and lower bounds¶
Paul, W. J. Kolmogorov's complexity and lower bounds.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Incompressibility method
- … information, Kolmogorov-complexity threshold, selected incompressible object, assumed counterproperty, explicit encoding and decoder, code-length saving and counting conclusion are explicit. to An applied instance preserves the same invariant under changed scale, notation, dataset, jurisdiction, or implementation..
This source2nd Int. Conf. Fund. Comput. Theory, 1979.
- … information, Kolmogorov-complexity threshold, selected incompressible object, assumed counterproperty, explicit encoding and decoder, code-length saving and counting conclusion are explicit. to An applied instance preserves the same invariant under changed scale, notation, dataset, jurisdiction, or implementation..
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:1948b21a74e3 · see in the full table