title: The complexity of proving chaoticity and the Church-Turing thesis.
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.
authors.affiliation: Department of Computer Science, University of Auckland, Private Bag 92019, 1142 Auckland, New Zealand. cristian@cs.auckland.ac.nz
authors.forename: Cristian S
authors.initials: CS
authors.lastname: Calude
authors.forename: Elena
authors.initials: E
authors.lastname: Calude
authors.forename: Karl
authors.initials: K
authors.lastname: Svozil