Kolmogorov complexity for possibly infinite computations
From MaRDI portal
Recommendations
- Program size complexity for possibly infinite computations
- Kolmogorov-Complexity Based on Infinite Computations
- Logical Approaches to Computational Barriers
- On Kolmogorov complexity in the real Turing machine setting
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
Cites work
- scientific article; zbMATH DE number 1665444 (Why is no real title available?)
- scientific article; zbMATH DE number 3427210 (Why is no real title available?)
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- A Theory of Program Size Formally Identical to Information Theory
- A variant of the Kolmogorov concept of complexity
- Algorithmic entropy of sets
- Information-theoretic characterizations of recursive infinite strings
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
- On degrees of unsolvability
- Several results in program size complexity
Cited in
(6)- Program size complexity for possibly infinite computations
- Anytime algorithms for non-ending computations
- Kolmogorov complexity conditional to large integers
- Kolmogorov Complexity and Noncomputability
- Kolmogorov complexities \(K_{\max}\), \(K_{\min}\) on computable partially ordered sets
- scientific article; zbMATH DE number 3924764 (Why is no real title available?)
This page was built for publication: Kolmogorov complexity for possibly infinite computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777368)
