Computational complexity of the initial value problem for the three-body problem

The paper deals with the computational complexity of the initial value problem (IVP) for a system of ordinary dynamical equations. A formal statement of the problem is given, containing a Turing machine with an oracle for getting the initial values as real numbers. It is proven that the computational complexity of the IVP for the three-body problem is not bounded by a polynomial. The proof is based on oscillatory solutions for the Sitnikov problem that have complex dynamical behavior. These solutions prevent the existence of an algorithm that solves the IVP in polynomial time.