activity
19972008
most citedThe Organization of Intrinsic Computation: Complexity-Entropy Diagrams and the Diversity of Natural Information Processing

129 citations · 417 across the 8 of their papers we have counts for

collaborators

8 papers

nlin.CD2008★ 129 cited

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

David P. Feldman, Carl S. McTague, James P. Crutchfield

Intrinsic computation refers to how dynamical systems store, structure, and transform historical and spatial information. By graphing a measure of structural complexity against a m…

cond-mat.stat-mech2002★ 104 cited

Structural Information in Two-Dimensional Patterns: Entropy Convergence and Excess Entropy

David P. Feldman, James P. Crutchfield

We develop information-theoretic measures of spatial structure and pattern in more than one dimension. As is well known, the entropy density of a two-dimensional configuration can…

nlin.AO2002

Synchronizing to Periodicity: The Transient Information and Synchronization Time of Periodic Sequences

David P. Feldman, James P. Crutchfield

We analyze how difficult it is to synchronize to a periodic sequence whose structure is known, when an observer is initially unaware of the sequence's phase. We examine the transie…

nlin.AO2001

Synchronizing to the Environment: Information Theoretic Constraints on Agent Learning

James P. Crutchfield, David P. Feldman

We show that the way in which the Shannon entropy of sequences produced by an information source converges to the source's entropy rate can be used to monitor how an intelligent ag…

cond-mat.stat-mech2001★ 7 cited

Regularities Unseen, Randomness Observed: Levels of Entropy Convergence

James P. Crutchfield, David P. Feldman

We study how the Shannon entropy of sequences produced by an information source converges to the source's entropy rate. We synthesize several phenomenological approaches to applyin…

chao-dyn1999★ 45 cited

Comment on "Simple Measure of Complexity"

James P. Crutchfield, David P. Feldman, Cosma Rohilla Shalizi

We critique the measure of complexity introduced by Shiner, Davison, and Landsberg in Ref. [1]. In particular, we point out that it is over-universal, in the sense that it has the…