A geometric approach to complexity

DOI10.1063/1.3638446zbMath1317.37039OpenAlexW2063608314WikidataQ51525591 ScholiaQ51525591MaRDI QIDQ5264340

Nihat Ay, Nils Bertschinger, Juergen Jost, Eckehard Olbrich

Publication date: 27 July 2015

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2aef13742a586388ddc6bfea5f87b99e89c98e14

Mathematics Subject Classification ID

Transition to stochasticity (chaotic behavior) for nonlinear problems in mechanics (70K55) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Related Items (12)

Information geometry on complexity and stochastic interaction ⋮ Towards an information geometric characterization/classification of complex systems. I: Use of generalized entropies ⋮ Information geometric methods for complexity ⋮ The uniqueness of the Fisher metric as information metric ⋮ A variational principle for ground spaces ⋮ From Complexity to Information Geometry and Beyond ⋮ Quantifying networks complexity from information geometry viewpoint ⋮ How should complexity scale with system size? ⋮ Maximizing the Divergence from a Hierarchical Model of Quantum States ⋮ Information and complexity, or: where is the information? ⋮ Information geometry and sufficient statistics ⋮ Entropy distance: New quantum phenomena

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Effective complexity of stationary process realizations
• How should complexity scale with system size?
• Toward a quantitative theory of self-generated complexity
• An information-geometric approach to a theory of pragmatic structuring
• Predictability, Complexity, and Learning
• Nonnegative entropy measures of multivariate symmetric correlations
• Information geometry on hierarchy of probability distributions
• Information projections revisited
• Effective Complexity and Its Relation to Logical Depth
• On the Length of Programs for Computing Finite Binary Sequences
• A formal theory of inductive inference. Part I
• Regularities unseen, randomness observed: Levels of entropy convergence
• Computational mechanics: pattern and prediction, structure and simplicity.

This page was built for publication: A geometric approach to complexity