The complexity of proving chaoticity and the Church–Turing thesis

DOI10.1063/1.3489096zbMath1311.68080OpenAlexW2092955657WikidataQ51652261 ScholiaQ51652261MaRDI QIDQ5251233

Elena Calude, Karl Svozil, Cristian S. Calude

Publication date: 19 May 2015

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

Full work available at URL: https://doi.org/10.1063/1.3489096

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Related Items (3)

A Program-Size Complexity Measure for Mathematical Problems and Conjectures ⋮ Inductive Complexity of P versus NP Problem ⋮ A computational journey into the mind

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Horseshoes in perturbations of Hamiltonian systems with two degrees of freedom
• Undecidability and incompleteness in classical mechanics
• A notion of mechanistic theory
• Dynamical system where proving chaos is equivalent to proving Fermat's conjecture
• Symbolic dynamics of one-dimensional maps: Entropies, finite precision, and noise
• Algorithmic Information Theory
• Zwei Unentscheidbare Probleme Der Analysis
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?

This page was built for publication: The complexity of proving chaoticity and the Church–Turing thesis