Computability of entropy and information in classical Hamiltonian systems

DOI10.1016/J.PHYSLETA.2009.02.050zbMATH Open1228.82056arXiv0808.1678OpenAlexW1981350833MaRDI QIDQ653552FDOQ653552

Sungyun Kim

Publication date: 19 December 2011

Published in: Physics Letters. A (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/0808.1678

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

zbMATH Keywords

entropyinformationcomputability

Mathematics Subject Classification ID

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

Cites Work

• On Information and Sufficiency
• A Mathematical Theory of Communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• The wave equation with computable initial data such that its unique solution is not computable
• The topological entropy of cellular automata is uncomputable
• Title not available (Why is that?)
• The existence of noncollision singularities in Newtonian systems
• Unpredictability and undecidability in dynamical systems
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
• Information-theoretic computation complexity
• IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
• A computable ordinary differential equation which possesses no computable solution
• The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
• Undecidability principle and the uncertainty principle even for classical systems
• The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations

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)