Complexity Reference: compref368 (BibTex)

Authors: Zvonkin,AK Levin,LA

Year: 1970

Title: The Complexity of Finite Objects and the Development of the Concepts of Information and Randomness by Means of the Theory of Algorithms

Journal: Russian Mathematics Surveys, 256, 83-124

Comments: A development of Kolmogorov Complexity defining randomness of finite strings as those which are algoritmically incompressable.

Keywords: RANDOMNESS, INFORMATION, KOLMOGOROV, COMPLEXITY,

| Top | Authors | Journals | Years | Keywords | Search | New | Comments |


Bruce Edmonds, Centre for Policy Modelling, Manchester Metropolitan University