Actions

Difference between revisions of "Module:Complexity"

From Santa Fe Institute Events Wiki

(Links)
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

Readings

The Calculi of Emergence

Pattern Discovery and Computational Mechanics

Many Roads to Synchrony: Natural Time Scales and Their Algorithms

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

The Organization of Intrinsic Computation: Complexity-Entropy Diagrams and the Diversity of Natural Information Processing

Anatomy of a Bit

Online Labs

CMPy Notebook