Preprint / scholarly article

A Two-Component Entropic Complexity for Discrete-Time Theories

K. Takahashi

Published
DOI
10.5281/zenodo.17784015

Full text PDF (Zenodo)

Abstract

A theory is defined as a probability law on bi-infinite (or semi-infinite) symbol sequences, while an implementation is a Markovian dynamical system with hidden states and an observation map that reproduces the same boundary law.

Keywords

  • discrete-time stochastic dynamics
  • temporal complexity
  • interface complexity
  • entropy rate
  • relative entropy
  • f-divergence
  • markov chains
  • non-equilibrium steady states
  • coarse-graining
  • path-space implementation
  • data processing inequality
  • stochastic thermodynamics

Identifiers and source records