Can every physical system simulate any Turing machine? This is a classical problem which is intimately connected with the undecidability of certain physical phenomena. Concerning fluid flows, Moore asked in [15] if hydrodynamics is capable of performing computations. More recently, Tao launched a programme based on the Turing completeness of the Euler equations to address the blow up problem in the Navier-Stokes equations. In this direction, the undecidability of some physical systems has been studied in recent years, from the quantum gap problem [7] to quantum field theories [11]. To the best of our knowledge, the existence of undecidable particle paths of 3D fluid flows has remained an elusive open problem since Moores works in the early 1990s. In this article we construct a Turing complete stationary Euler flow on a Riemannian $S^3$ and speculate on its implications concerning Taos approach to the blow up problem in the Navier-Stokes equations.
تحميل البحث