Difference between revisions of "Module:Complexity"
From Santa Fe Institute Events Wiki
(→Lecture Notes) |
(→Lecture Notes) |
||
Line 34: | Line 34: | ||
</ol> | </ol> | ||
</ul> | </ul> | ||
+ | |||
+ | ===Ryan's talks=== | ||
+ | <ol> | ||
+ | <li> [[Media:Anatomy_talk.pdf Anatomy of a Bit]] | ||
==Readings== | ==Readings== |
Revision as of 15:23, 23 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 1A (PDF)
- Information Theory: Complexity Lecture 1B (PDF)
- Information in Processes: Complexity Lecture 1C (PDF)
- Memory in Processes: Complexity Lecture 1D (PDF)
- Friday
- The Learning Channel: Complexity Lecture 2A (PDF)
- Causal Models: Complexity Lecture 2B (PDF)
- Measures of Complexity: Complexity Lecture 2C (PDF)
- Applications: Complexity Lecture 2D (PDF)