Cited By
View all- Allender E(1987)Some consequences of the existence of pseudorandom generatorsProceedings of the nineteenth annual ACM symposium on Theory of computing10.1145/28395.28412(151-159)Online publication date: 1-Jan-1987
Abstract
No abstract available.
Index Terms
- On generalized Kolmogorov complexity
Recommendations
Kolmogorov Complexity for Possibly Infinite Computations
In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired ...
An Additivity Theorem for Plain Kolmogorov Complexity
We prove the formula C(a,b)=K(a|C(a,b))+C(b|a,C(a,b))+O(1) that expresses the plain complexity of a pair in terms of prefix-free and plain conditional complexities of its components.
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 January 1986
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 04 Jan 2025
Other Metrics
Citations
Cited By
View all- Allender E(1987)Some consequences of the existence of pseudorandom generatorsProceedings of the nineteenth annual ACM symposium on Theory of computing10.1145/28395.28412(151-159)Online publication date: 1-Jan-1987