Module:Complexity: Difference between revisions
From Santa Fe Institute Events Wiki
(→Readings: add a few papers) |
|||
Line 44: | Line 44: | ||
'''[http://tuvalu.santafe.edu/~cmg/compmech/pubs/CalcEmergTitlePage.html The Calculi of Emergence]''' | '''[http://tuvalu.santafe.edu/~cmg/compmech/pubs/CalcEmergTitlePage.html The Calculi of Emergence]''' | ||
'''[http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.118.640&rep=rep1&type=pdf An Information-Theoretic Primer on Complexity, Self-Organisation and Emergence]''' | |||
'''[http://arxiv.org/abs/cs/0001027 Pattern Discovery and Computational Mechanics]''' | '''[http://arxiv.org/abs/cs/0001027 Pattern Discovery and Computational Mechanics]''' | ||
Line 58: | Line 60: | ||
'''[http://arxiv.org/abs/1105.2988 Anatomy of a Bit]''' | '''[http://arxiv.org/abs/1105.2988 Anatomy of a Bit]''' | ||
'''[http://chaos.aip.org/resource/1/chaoeh/v20/i3/p037109_s1?isAuthorized=no Information modification and particle collisions in distributed computation]''' | |||
'''[http://arxiv.org/abs/0902.0600 Reconstruction of Epsilon-Machines in Predictive Frameworks and Decisional States]''' | |||
'''[http://arxiv.org/abs/1012.1890 A measure of statistical complexity based on predictive information]''' | |||
==Online Labs== | ==Online Labs== | ||
'''[http://172.29.16.101:8000 CMPy Notebook]''' | '''[http://172.29.16.101:8000 CMPy Notebook]''' |
Revision as of 20:05, 24 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)
Ryan's talks
Readings
An Information-Theoretic Primer on Complexity, Self-Organisation and Emergence
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
Information modification and particle collisions in distributed computation
Reconstruction of Epsilon-Machines in Predictive Frameworks and Decisional States
A measure of statistical complexity based on predictive information