Computability of entropy and information in classical Hamiltonian systems

DOI10.1016/J.PHYSLETA.2009.02.050MaRDI QIDQ653552zbMATH OpenOpenAlexFDO

Authors Sungyun Kim

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

zbMATH Keywords

computabilityentropyinformation

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Classical dynamic and nonequilibrium statistical mechanics (general) (82C05) Measures of information, entropy (94A17)

Abstract: We consider the computability of entropy and information in classical Hamiltonian systems. We define the information part and total information capacity part of entropy in classical Hamiltonian systems using relative information under a computable discrete partition. Using a recursively enumerable nonrecursive set it is shown that even though the initial probability distribution, entropy, Hamiltonian and its partial derivatives are computable under a computable partition, the time evolution of its information capacity under the original partition can grow faster than any recursive function. This implies that even though the probability measure and information are conserved in classical Hamiltonian time evolution we might not actually compute the information with respect to the original computable partition.

Recommendations

• Dynamical systems and computable information
• Computability and information in models of randomness and chaos
• Computing in Finite Time
• Entropy as a fixed point
• scientific article; zbMATH DE number 2026096

Cites work

• A computable ordinary differential equation which possesses no computable solution
• A Mathematical Theory of Communication
• scientific article; zbMATH DE number 42077 (Why is no real title available?)
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Information-theoretic computation complexity
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• On Information and Sufficiency
• On the computability of the topological entropy of subshifts
• The existence of noncollision singularities in Newtonian systems
• The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
• The topological entropy of cellular automata is uncomputable
• The wave equation with computable initial data such that its unique solution is not computable
• 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
• Undecidability principle and the uncertainty principle even for classical systems
• Unpredictability and undecidability in dynamical systems

Cited in

(2)

• Some results on Tsallis entropy measure and k-record values
• Hamiltonian complexity in the thermodynamic limit

This page was built for publication: Computability of entropy and information in classical Hamiltonian systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653552)