If you’ve never heard of Kolmogorov

If you’ve never heard of Kolmogorov you may have heard of Claude Shannon.  This paper gives a connection between the work of Kolmogorov and Shannon:

Wald Lecture I: Counting Bits with Kolmogorov and Shannon
Wald Lecture I: Counting Bits with Kolmogorov and Shannon David L. Donoho Stanford University Abstract Shannon’s Rate-Distortion Theory describes the number of bits …

Shannon’s magnum opus was

A Mathematical Theory of Communication – worrydream.com
Reprinted with corrections from The Bell System Technical Journal, Vol. 27, pp. 379–423, 623–656, July, October, 1948. A Mathematical Theory of Communication

Shannon’s main idea was bit rate in a channel, how many bits you can reliably pass in a second.  Kolmogorov’s main idea was how compressible the bits of an object were, in the sense of how short a program can you write to generate the bits of the object

Kolmogorov complexity – Wikipedia, the free encyclopedia
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity (also known as descriptive complexity, Kolmogorov …
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s