Fermat's Last Theorem and Chaoticity

Calude, E.

dc.contributor.author	Calude, E.	en
dc.date.accessioned	2012-01-16T03:19:42Z	en
dc.date.available	2012-01-16T03:19:42Z	en
dc.date.issued	2010	en
dc.identifier.citation	CDMTCS Research Reports CDMTCS-383 (2010)	en
dc.identifier.issn	1178-3540	en
dc.identifier.uri	http://hdl.handle.net/2292/10536	en
dc.description.abstract	Proving that a dynamical system is chaotic is a central problem in chaos theory [11]. In this note we apply the computational method developed in [4, 2, 3] 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.	en
dc.publisher	Department of Computer Science, The University of Auckland, New Zealand	en
dc.relation.ispartofseries	CDMTCS Research Report Series	en
dc.rights.uri	https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm	en
dc.source.uri	http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial	en
dc.title	Fermat's Last Theorem and Chaoticity	en
dc.type	Technical Report	en
dc.subject.marsden	Fields of Research::280000 Information, Computing and Communication Sciences	en
dc.rights.holder	The author(s)	en
dc.rights.accessrights	http://purl.org/eprint/accessRights/OpenAccess	en