pith. sign in

arxiv: 0902.1209 · v1 · pith:DQVL5GC2new · submitted 2009-02-07 · ❄️ cond-mat.stat-mech · cond-mat.dis-nn

Time's Barbed Arrow: Irreversibility, Crypticity, and Stored Information

classification ❄️ cond-mat.stat-mech cond-mat.dis-nn
keywords informationamountcausalcrypticityexcessirreversibilityoptimalstored
0
0 comments X
read the original abstract

We show why the amount of information communicated between the past and future--the excess entropy--is not in general the amount of information stored in the present--the statistical complexity. This is a puzzle, and a long-standing one, since the latter is what is required for optimal prediction, but the former describes observed behavior. We layout a classification scheme for dynamical systems and stochastic processes that determines when these two quantities are the same or different. We do this by developing closed-form expressions for the excess entropy in terms of optimal causal predictors and retrodictors--the epsilon-machines of computational mechanics. A process's causal irreversibility and crypticity are key determining properties.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.