The Complexity of Proving Chaoticity and the Church-Turing Thesis
Chaotic Dynamics
2010-09-30 v2 Computational Complexity
General Physics
Abstract
Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, one argues that it is not unconceivable that classical physical systems may "compute the hard or even the incomputable" by measuring observables which correspond to computationally hard or even incomputable problems.
Cite
@article{arxiv.1006.2951,
title = {The Complexity of Proving Chaoticity and the Church-Turing Thesis},
author = {Cristian S. Calude and Elena Calude and Karl Svozil},
journal= {arXiv preprint arXiv:1006.2951},
year = {2010}
}
Comments
13 pages, new proof of the main theorem