Module:Complexity: Difference between revisions
From Santa Fe Institute Events Wiki
No edit summary |
|||
| Line 18: | Line 18: | ||
==Lecture Notes== | ==Lecture Notes== | ||
<ul> | |||
<li>Thursday | |||
<ol> | |||
<li>Processes and Their Models | |||
<li>Information Theory | |||
<li>Information in Processes | |||
<li>Memory in Processes | |||
</ol> | |||
<li>Friday | |||
<ol> | |||
<li>The Learning Channel | |||
<li>Causal Models | |||
<li>Measures of Complexity | |||
<li>Applications | |||
</ol> | |||
</ul> | |||
==Readings== | ==Readings== | ||
Revision as of 16:51, 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
- Information Theory
- Information in Processes
- Memory in Processes
- Friday
- The Learning Channel
- Causal Models
- Measures of Complexity
- Applications
Readings
Pattern Discovery and Computational Mechanics