dc.contributor.author |
Calude, C.S. |
en |
dc.contributor.author |
Calude, E. |
en |
dc.contributor.author |
Svozil, K. |
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-384 (2010) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/10537 |
en |
dc.description.abstract |
Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, classical physical systems may “compute
the hard or even the incomputable” by measuring observables which correspond to
computationally hard or even incomputable problems. |
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 |
The Complexity of Proving Chaoticity and the Church-Turing Thesis |
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 |