The KoLMogorov Test: Compression by Code Generation
ICLR'25, 2025. [All Versions]. Compression is at the heart of intelligence. A theoretically optimal way to compress any sequence of data is to find the shortest program that outputs that sequence and then halts. However, such Kolmogorov compression is uncomputable, and code…
- from
- AGI & CoCoSci
- added
- 2026-10-10
- likes
- 0
similar
-
An introduction to Kolmogorov complexity and its applications link.springer.com
Springer, 2008. [All Versions]. The introductory book for Algorithmic Information Theory, especially the Kolmogorov complexity theory.
-
-
Program Synthesis microsoft.com
Foundations and Trends in Programming Languages, 2017. [All Versions]. Sumit Gulwani's comprehensive review on program synthesis.
-
PE Compression Test web.archive.org
List of packers tested on a few sample executables for comparing compressed sizes.
-
Metacontrol for Adaptive Imagination-Based Optimization openreview.net
ICLR'17, 2017. [All Versions].
-
A Logic Programming Language for Computational Nucleic Acid Devices pubs.acs.org
ACS Synthetic Biology, 2018. [All Versions]. This paper presents a logic programming language that allows a broad range of computational nucleic acid systems to be designed and analyzed. The language extends standard logic programming with a novel equational theory to express…
AGI & CoCoSci › Papers > Domain Specific Language > Logic DSL Applications: “ICLR'25, 2025. [All Versions]. Compression is at the heart of intelligence. A theoretically optimal way to compress any sequence of data is to find the shortest program that outputs that sequence and then halts. However, such Kolmogorov compression is uncomputable, and code…”