Buscar
Mostrando ítems 1-1 de 1
Artículo
A computable measure of algorithmic probability by finite approximations with an application to integer sequences
(Hindawi/Wiley, 2017)
Given the widespread use of lossless compression algorithms to approximate algorithmic (Kolmogorov-Chaitin) complexity, and that lossless compression algorithms fall short at characterizing patterns other than statistical ...