Module:Complexity: Difference between revisions
From Santa Fe Institute Events Wiki
(→Links) |
No edit summary |
||
| Line 6: | Line 6: | ||
<ul> | <ul> | ||
<li> | <li> | ||
T. Cover and J.Thomas, Elements of Information Theory, | T. Cover and J.Thomas, <i>Elements of Information Theory</i>, | ||
Wiley, Second Edition (2006) Chapters 1 - 7. | Wiley, Second Edition (2006) Chapters 1 - 7. | ||
<li> | <li> | ||
M. Li and P.M.B.Vitanyi, An Introduction to Kolmogorov Complexity and its Applications, | M. Li and P.M.B.Vitanyi, <i>An Introduction to Kolmogorov Complexity and its Applications </i>, | ||
Springer, New York (1993). | Springer, New York (1993). | ||
<li> | <li> | ||
Revision as of 21:33, 22 June 2011
| Complex Systems Summer School 2011 Modules |
Organized by Jim Crutchfield
Background
- T. Cover and J.Thomas, Elements of Information Theory, Wiley, Second Edition (2006) Chapters 1 - 7.
- M. Li and P.M.B.Vitanyi, An Introduction to Kolmogorov Complexity and its Applications , Springer, New York (1993).
- J. P. Crutchfield and D. P. Feldman, “Regularities Unseen, Randomness Observed: Levels of Entropy Convergence”,CHAOS 13:1 (2003) 25-54.
Lecture Notes
- Thursday
- Processes and Their Models: Complexity Lecture 1 (PDF)
- Information Theory: Complexity Lecture 1 (PDF)
- Information in Processes: Complexity Lecture 1 (PDF)
- Memory in Processes: Complexity Lecture 1 (PDF)
- Friday
- The Learning Channel: Complexity Lecture 2 (PDF)
- Causal Models: Complexity Lecture 2 (PDF)
- Measures of Complexity: Complexity Lecture 2 (PDF)
- Applications: Complexity Lecture 2 (PDF)
Readings
Pattern Discovery and Computational Mechanics
Many Roads to Synchrony: Natural Time Scales and Their Algorithms
Information Accessibility and Cryptic Processes
Prediction, Retrodiction, and The Amount of Information Stored in the Present