Calculating Kolmogorov complexity from the output frequency distributions of small Turing machines

Drawing on various notions from theoretical computer science, we present a novel numerical approach, motivated by the notion of algorithmic probability, to the problem of approximating the Kolmogorov-Chaitin complexity of short strings. The method is an alternative to the traditional lossless compre...

全面介紹

書目詳細資料
Main Authors: Soler−Toscano, F, Zenil, H, Delahaye, J, Gauvrit, N
格式: Journal article
出版: Public Library of Science 2014

相似書籍