Kolmogorov's contributions to information theory and algorithmic complexity (Q582861)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Kolmogorov's contributions to information theory and algorithmic complexity |
scientific article; zbMATH DE number 4131622
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Kolmogorov's contributions to information theory and algorithmic complexity |
scientific article; zbMATH DE number 4131622 |
Statements
Kolmogorov's contributions to information theory and algorithmic complexity (English)
0 references
1989
0 references
From the author's preface: ''This is a discussion of \(\to olmogorov's\) contributions to Shannon information theory followed by a development of his ideas on algorithmic complexity. It becomes clear in hindsight that an interest in complexity was a dominant theme in Kolmogorov's thinking. In particular, he was interested in finding determinism in random events and in defining the structure of discrete objects, whether it be the law of large numbers or a notion of intrinsic complexity. Even his work on turbulence theory can be seen in this light as an attempt to find deterministic order in chaotic processes.''
0 references
information theory
0 references
algorithmic complexity
0 references
0.90273756
0 references
0.90187335
0 references
0.8929857
0 references