WRSWorld Research StateContribute
WORLD RESEARCH STATE

Kolmogorov: description length through algorithms

Contribution grade

Algorithmic information · Algorithmic information

Reference score235,000Provisional editorial estimate of this exact contribution; its grade is assessed separately.

What changed

Description length under optimal methods supplies a non-probabilistic account of the information in an individual object, invariant up to an additive constant and generally noncomputable.

Scientific scope

Description length under optimal methods supplies a non-probabilistic account of the information in an individual object, invariant up to an additive constant and generally noncomputable. Objects require an encoding and description method. The comparison constant is not zero, and the resulting complexity is not generally computable. Program length does not charge the time needed to find or execute a program.

Evidence

Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.

Contributors

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction