The complexity of proving chaoticity and the Church-Turing thesis

Chaos. 2010 Sep;20(3):037103. doi: 10.1063/1.3489096.

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.