论复杂性与随机性的关系

On Relationships between Complexity and Randomicity

本文通过对历史上复杂性与随机性关系的认识回顾 ,展示和分析了起源于计算机科学领域的Kolmogorov复杂性与随机性的直接关联 ,分析了盖尔曼的有效复杂性概念 ,论证了两种复杂性与随机性的关系 ,以及随机性的不同情况 ,力图剥离混合在复杂性与随机性相互关系上的一些误读和误解 ,还复杂性与随机性一种客观的本真关系。

Through review historical cognitions on relations between complexity and randomicity, bring forth and analyzing immediate relationships between randomicity and Kolmogorov complexity from computer science, this paper tries to peel off some errors understanding on this relations and to return real relations about the them, and analyzing Gell Mann effective complexity concept, argument that two relations between complexity and randomicity, and three random instances.