Computability of entropy and information in classical Hamiltonian systems
From MaRDI portal
Publication:653552
DOI10.1016/j.physleta.2009.02.050zbMath1228.82056arXiv0808.1678MaRDI QIDQ653552
Publication date: 19 December 2011
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0808.1678
94A17: Measures of information, entropy
03D80: Applications of computability and recursion theory
82C05: Classical dynamic and nonequilibrium statistical mechanics (general)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- The wave equation with computable initial data such that its unique solution is not computable
- The existence of noncollision singularities in Newtonian systems
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- A computable ordinary differential equation which possesses no computable solution
- The topological entropy of cellular automata is uncomputable
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- Unpredictability and undecidability in dynamical systems
- Undecidability principle and the uncertainty principle even for classical systems
- Information-theoretic computation complexity
- The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
- On Information and Sufficiency