The complexity of proving chaoticity and the Church–Turing thesis
Cristian S. Calude, Elena Calude, Karl Svozil · Chaos An Interdisciplinary Journal of Nonlinear Science · 2010
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.