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 Dell Mann effective complexity concept，argument that two relations between complexity and randomicity，and three random instances.
本文下载地址: On Relationships betheen Complexity and Randomicity(p.18)