Kolmogorov complexity as a combinatorial tool

DOI10.1007/978-3-031-64309-5_3MaRDI QIDQ7030918zbMATH OpenFDO

Authors A. Shen

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-64309-5_3

zbMATH Keywords

combinatorial gamesexperts aggregationKolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites work

• An introduction to Kolmogorov complexity and its applications
• An operational characterization of mutual information in algorithmic information theory
• Complex tilings
• Compressibility and probabilistic proofs
• Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences
• Kolmogorov complexity as a language
• Partitioning multi-dimensional sets in a small number of ``uniform parts

This page was built for publication: Kolmogorov complexity as a combinatorial tool

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030918)