论文标题
Kolmogorov的复杂性是多么无可理解？
How incomputable is Kolmogorov complexity?
论文作者
论文摘要
Kolmogorov复杂性是最终压缩版本的文件（即可以放入计算机中的任何东西）的长度。正式地，它是可以重建文件的最短程序的长度。我们讨论了Kolmogorov复杂性的无关，这使我们造成了正式的漏洞，即计算或近似Kolmogorov复杂性的最新方法，方法是有问题的，哪些方法是可行的。
Kolmogorov complexity is the length of the ultimately compressed version of a file (that is, anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed. We discuss the incomputabilty of Kolmogorov complexity, which formal loopholes this leaves us, recent approaches to compute or approximate Kolmogorov complexity, which approaches are problematic and which approaches are viable.
