Several results in program size complexity
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- A Theory of Program Size Formally Identical to Information Theory
- A variant of the Kolmogorov concept of complexity
- Complexity dips in random infinite binary sequences
- Information-theoretic characterizations of recursive infinite strings
- Noncomplex sequences: characterizations and examples
- On Kolmogorov's complexity and information
- On degrees of unsolvability
- On non-computable functions
- On the size of machines
- Program size, oracles, and the jump operation
This page was built for publication: Several results in program size complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1152214)