Randomness, Structure and Causality - Agenda: Difference between revisions
From Santa Fe Institute Events Wiki
No edit summary |
No edit summary |
||
Line 58: | Line 58: | ||
Links: [[File:Darwin.pdf]] | Links: [[File:Darwin.pdf]] | ||
---- | ---- | ||
Framing Complexity | '''Framing Complexity''' | ||
<br> | <br> | ||
<br> | <br> | ||
Line 94: | Line 94: | ||
---- | ---- | ||
'''Prediction, Retrodiction, and the Amount of Information Stored in the Present''' | |||
<br> | |||
<br> | |||
Ellison, Christopher (cellison@cse.ucdavis.edu)<br> | |||
Complexity Sciences Center, UC Davis | |||
<br> | |||
<br> | |||
Links: [[http://arxiv.org/abs/0905.3587]] | |||
---- | |||
'''Spatial Information Theory''' | |||
<br> | |||
<br> | |||
Feldman, David (dave@hornacek.coa.edu)<br> | |||
College of the Atlantic | |||
<br> | |||
<br> | |||
Links: [[File:afm.tri.5.pdf]] and [[File:CHAOEH184043106_1.pdf | |||
---- | |||
'''Crypticity and Information Accessibility''' | |||
<br><br> | |||
Mahoney, John (jmahoney3@ucmerced.edu)<br> | |||
UC Merced | |||
<br> | |||
<br> | |||
Links: [[http://arxiv.org/abs/0905.4787]] | |||
---- | |||
'''Complexity, Parallel Computation and Statistical Physics''' | |||
<br><br> | |||
Machta, Jon (machta@physics.umass.edu) | |||
<br> | |||
SFI & University of Massachusetts | |||
<br> | |||
<br> | |||
Links: [[http://arxiv.org/abs/cond-mat/0510809]] | |||
---- | |||
'''Automatic Identification of Information-Processing Structures in Cellular Automata''' | '''Automatic Identification of Information-Processing Structures in Cellular Automata''' | ||
<br> | <br> | ||
<br> | |||
Mitchell, Melanie (mm@cs.pdx.edu) | Mitchell, Melanie (mm@cs.pdx.edu) | ||
<br> | <br> | ||
Line 104: | Line 141: | ||
Cellular automata have been widely used as idealized models of natural spatially-extended dynamical systems. An open question is how to best understand such systems in terms of their information-processing capabilities. In this talk we address this question by describing several approaches to automatically identifying the structures underlying information processing in cellular automata. In particular, we review the computational mechanics methods of Crutchfield et al., the local sensitivity and local statistical complexity filters proposed by Shalizi et al., and the information theoretic filters proposed by Lizier et al. We illustrate these methods by applying them to several one- and two-dimensional cellular automata that have been designed to perform the so-called density (or majority) classification task. | Cellular automata have been widely used as idealized models of natural spatially-extended dynamical systems. An open question is how to best understand such systems in terms of their information-processing capabilities. In this talk we address this question by describing several approaches to automatically identifying the structures underlying information processing in cellular automata. In particular, we review the computational mechanics methods of Crutchfield et al., the local sensitivity and local statistical complexity filters proposed by Shalizi et al., and the information theoretic filters proposed by Lizier et al. We illustrate these methods by applying them to several one- and two-dimensional cellular automata that have been designed to perform the so-called density (or majority) classification task. | ||
---- | |||
'''Statistical Mechanics of Interactive Learning''' | |||
<br> | |||
<br> | |||
Still, Suzanne (sstill@hawaii.edu)<br> | |||
University of Hawaii at Manoa | |||
<br><br> | |||
Links: | |||
---- | |||
'''Measuring the Complexity of Psychological States''' | |||
<br> | |||
<br> | |||
Tononi, Guilio (gtononi@wisc.edu)<br> | |||
University of Michigan | |||
<br><br> | |||
Links: | |||
---- | |||
'''Ergodic Parameters and Dynamical Complexity''' | |||
<br> | |||
<br> | |||
Vilela-Mendes, Rui (vilela@cii.fc.ul.pt) | |||
<br> | |||
University of Lisbon | |||
<br> | |||
<br> | |||
Links: [[http://arxiv.org/abs/1008.2664]] | |||
---- | |||
'''Hidden Quantum Markov Models and Non-adaptive Read-out of Many-body States''' | |||
<br> | |||
<br> | |||
Wiesner, Karoline (k.wiesner@bristol.ac.uk) | |||
<br> | |||
University of Bristol | |||
<br> | |||
<br> | |||
Links: [[http://arxiv.org/abs/1002.2337]] | |||
---- | ---- |
Revision as of 19:07, 16 December 2010
Workshop Navigation |
Abstracts
Effective Complexity of Stationary Process Realizations
Ay, Nihat (nay@mis.mpg.de)
SFI & Max Planck Institute
Links: [[1]]
Learning Out of Equilibrium
Bell, Tony (tony@salk.edu)
UC Berkeley
Links:
The Transmission of Sense Information
Bergstrom, Carl (cbergst@u.washington.edu)
SFI & University of Washington
Links: [[2]]
Optimizing Information Flow in Small Genetic Networks
Bialek, William (wbialek@Princeton.EDU)
Princeton University
Links: [[3]]
To a Mathematical Theory of Evolution and Biological Creativity
Chaitin, Gregory (gjchaitin@gmail.com)
IBM Watson Research Center
We present an information-theoretic analysis of Darwin’s theory of evolution, modeled as a hill-climbing algorithm on a fitness landscape. Our space of possible organisms consists of computer programs, which are subjected to random mutations. We study the random walk of increasing fitness made by a single mutating organism. In two different models we are able to show that evolution will occur and to characterize the rate of evolutionary progress, i.e., the rate of biological creativity.
Links: File:Darwin.pdf
Framing Complexity
Crutchfield, James (chaos@cse.ucdavis.edu)
SFI & UC Davis
Links: [[4]]
The Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts
Debowski, Lukasz (ldebowsk@ipipan.waw.pl)
Polish Academy of Sciences
We will present a new explanation for the distribution of words in
natural language which is grounded in information theory and inspired
by recent research in excess entropy. Namely, we will demonstrate a
theorem with the following informal statement: If a text of length
describes independent facts in a repetitive way then the
text contains at least different words. In the
formal statement, two modeling postulates are adopted. Firstly, the
words are understood as nonterminal symbols of the shortest
grammar-based encoding of the text. Secondly, the text is assumed to
be emitted by a finite-energy strongly nonergodic source whereas the
facts are binary IID variables predictable in a shift-invariant
way. Besides the theorem, we will exhibit a few stochastic processes
to which this and similar statements can be related.
Links: [[5]] and [[6]]
Prediction, Retrodiction, and the Amount of Information Stored in the Present
Ellison, Christopher (cellison@cse.ucdavis.edu)
Complexity Sciences Center, UC Davis
Links: [[7]]
Spatial Information Theory
Feldman, David (dave@hornacek.coa.edu)
College of the Atlantic
Links: File:Afm.tri.5.pdf and [[File:CHAOEH184043106_1.pdf
Crypticity and Information Accessibility
Mahoney, John (jmahoney3@ucmerced.edu)
UC Merced
Links: [[8]]
Complexity, Parallel Computation and Statistical Physics
Machta, Jon (machta@physics.umass.edu)
SFI & University of Massachusetts
Links: [[9]]
Automatic Identification of Information-Processing Structures in Cellular Automata
Mitchell, Melanie (mm@cs.pdx.edu)
SFI & Portland State University
Cellular automata have been widely used as idealized models of natural spatially-extended dynamical systems. An open question is how to best understand such systems in terms of their information-processing capabilities. In this talk we address this question by describing several approaches to automatically identifying the structures underlying information processing in cellular automata. In particular, we review the computational mechanics methods of Crutchfield et al., the local sensitivity and local statistical complexity filters proposed by Shalizi et al., and the information theoretic filters proposed by Lizier et al. We illustrate these methods by applying them to several one- and two-dimensional cellular automata that have been designed to perform the so-called density (or majority) classification task.
Statistical Mechanics of Interactive Learning
Still, Suzanne (sstill@hawaii.edu)
University of Hawaii at Manoa
Links:
Measuring the Complexity of Psychological States
Tononi, Guilio (gtononi@wisc.edu)
University of Michigan
Links:
Ergodic Parameters and Dynamical Complexity
Vilela-Mendes, Rui (vilela@cii.fc.ul.pt)
University of Lisbon
Links: [[10]]
Hidden Quantum Markov Models and Non-adaptive Read-out of Many-body States
Wiesner, Karoline (k.wiesner@bristol.ac.uk)
University of Bristol
Links: [[11]]