Fermat's last theorem and chaoticity

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Proving that a dynamical system is chaotic is a central problem in chaos theory (Hirsch in Chaos, fractals and dynamics, 1985]. In this note we apply the computational method developed in (Calude and Calude in Complex Syst 18:267-285, 2009; Calude and Calude in Complex Syst 18:387-401, 2010; Calude et al in J Multi Valued Log Soft Comput 12:285-307, 2006) to show that Fermat's last theorem is in the lowest complexity class CU;1. Using this result we prove the existence of a two-dimensional Hamiltonian system for which the proof that the system has a Smale horseshoe is in the class CU;1, i.e. it is not too complex. © Springer Science+Business Media B.V. 2011.

Cite

CITATION STYLE

APA

Calude, E. (2012). Fermat’s last theorem and chaoticity. In Natural Computing (Vol. 11, pp. 241–245). https://doi.org/10.1007/s11047-011-9282-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free