Thermodynamic Depth of Causal States: When Paddling Around in Occam's Pool Shallowness Is a Virtue

Thermodynamic depth is an appealing but flawed complexity measure. It depends on a set of macroscopic states for a system, but neither its original introduction by Lloyd and Pagels nor any follow-up work has considered how to select these states. Depth, therefore, is at root subjective. Computational mechanics provides a definition for a system'[s minimal, necessary causal states and a procedure for finding them. We show that the rate of increase in thermodynamic depth, or "dive," is the system's reverse-time Shannon entropy rate, and so depth only measures degrees of macroscopic randomness, not structure. We redefine the depth in terms of the causal state representation--- epsilon-machines---and show that this representation gives the minimum dive consistent with accurate predition. Thus, epsilon-machines are optimally shallow.

[1]  Philotheus Boehner,et al.  Philosophical writings : a selection , 1964 .

[2]  Robert L. Devaney,et al.  A First Course In Chaotic Dynamical Systems: Theory And Experiment , 1993 .

[3]  H. Fogedby On the phase space approach to complexity , 1992 .

[4]  James P. Crutchfield,et al.  Discovering Noncritical Organization: Statistical Mechanical, Information Theoretic, and Computational Views of Patterns in One-Dimensional Spin Systems , 1998, Entropy.

[5]  Gregory J. Chaitin,et al.  On the Length of Programs for Computing Finite Binary Sequences , 1966, JACM.

[6]  Rolf Landauer,et al.  A simple measure of complexity , 1988, Nature.

[7]  Charles H. Bennett,et al.  On the nature and origin of complexity in discrete, homogeneous, locally-interacting systems , 1986 .

[8]  J. Crutchfield,et al.  Measures of statistical complexity: Why? , 1998 .

[9]  James P. Crutchfield,et al.  Unreconstructible at any radius , 1992 .

[10]  R. Badii,et al.  Complexity: Hierarchical Structures and Scaling in Physics , 1997 .

[11]  S. Lloyd,et al.  Complexity as thermodynamic depth , 1988 .

[12]  Yi-Cheng Zhang Complexity and 1/f noise. A phase space approach , 1991 .

[13]  J. Crutchfield The calculi of emergence: computation, dynamics and induction , 1994 .

[14]  Mats G. Nordahl,et al.  Complexity Measures and Cellular Automata , 1988, Complex Syst..

[15]  Young,et al.  Inferring statistical complexity. , 1989, Physical review letters.

[16]  C. E. SHANNON,et al.  A mathematical theory of communication , 1948, MOCO.

[17]  J. Kurths,et al.  A Comparative Classification of Complexity Measures , 1994 .

[18]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.