Information and Complexity
3 principal results:
- Shannon’s source-coding theorem
- The main theorem of information content
- A measure of the number of bits needed to specify the expected outcome of an experiment
- Shannon’s noisy-channel coding theorem
- Describes how much information we can transmit over a channel
- A strict bound on information transfer
- Kolmogorov–Chaitin complexity
- Measures the algorithmic information content of a string
- An uncomputable function