Fermat's last theorem and chaoticity
From MaRDI portal
Publication:2629932
DOI10.1007/s11047-011-9282-9zbMath1360.68522OpenAlexW2169523736MaRDI QIDQ2629932
Publication date: 8 July 2016
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-011-9282-9
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Higher degree equations; Fermat's equation (11D41)
Related Items
A Program-Size Complexity Measure for Mathematical Problems and Conjectures, INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS
Cites Work
- Horseshoes in perturbations of Hamiltonian systems with two degrees of freedom
- Dynamical system where proving chaos is equivalent to proving Fermat's conjecture
- Modular elliptic curves and Fermat's Last Theorem
- The Undecidability of the Existence of Zeros of Real Elementary Functions
- Randomness on computable probability spaces - A dynamical point of view
- Some undecidable problems involving elementary functions of a real variable
- On Canonical Forms and Simplification
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item