Back to Search
Start Over
Kolmogorov complexity as a combinatorial tool
- Publication Year :
- 2024
-
Abstract
- Kolmogorov complexity is often used as a convenient language for counting and/or probabilistic existence proofs. However, there are some applications where Kolmogorov complexity is used in a more subtle way. We provide one (somehow) surprising example where an existence of a winning strategy in a natural combinatorial game is proven (and no direct proof is known).<br />Comment: Prepared as an special session invited talk at CiE 2024
Details
- Database :
- arXiv
- Publication Type :
- Report
- Accession number :
- edsarx.2405.09304
- Document Type :
- Working Paper