1 paper
Shuichi Hirahara, Zhenjian Lu, Mikito Nanashima
The coding theorem for Kolmogorov complexity states that any string sampled from a computable distribution has a description length close to its information content. A coding theor…