Enumerations including laconic enumerators
From MaRDI portal
Publication:2410366
Recommendations
Cites work
- A proof of Beigel's cardinality conjecture
- Algorithmic randomness and complexity.
- An introduction to Kolmogorov complexity and its applications
- Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
- Enumerations of the Kolmogorov function
- Frequency computations and the cardinality theorem
- Index sets and universal numberings
- Information-theoretic characterizations of recursive infinite strings
- On approximate decidability of minimal programs
- Optimal enumerations and optimal gödel numberings
- Short lists for shortest descriptions in short time
- Short lists with short programs from programs of functions and strings
- Short lists with short programs in short time
- Short lists with short programs in short time -- a short proof
- The complexity of the set of nonrandom numbers
- Three approaches to the quantitative definition of information*
Cited in
(6)
This page was built for publication: Enumerations including laconic enumerators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2410366)