Module:Complexity
From Santa Fe Institute Events Wiki
Complex Systems Summer School 2011 Modules |
Organized by Jim Crutchfield
Contents
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
[hhttp://arxiv.org/abs/1007.5354 Synchronization and Control in Intrinsic and Designed Computation: An Information-Theoretic Analysis of Competing Models of Stochastic Computation]
Information Accessibility and Cryptic Processes
Prediction, Retrodiction, and The Amount of Information Stored in the Present