Constructing Turing complete Euler flows in dimension 3

12/23/2020
∙
by   Robert Cardona, et al.
∙
0
∙

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 Moore's works in the early 1990's. In this article we construct a Turing complete stationary Euler flow on a Riemannian S^3 and speculate on its implications concerning Tao's approach to the blow up problem in the Navier-Stokes equations.

READ FULL TEXT

Please sign up or login with your details

Continue with:
Or login with email
Enter Password
Re-enter Password

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×
Pro

Consider DeepAI Pro

Subscribe to DeepAI Pro
DeepAI Pro
Provides a limited generation allowance each month. When exceeded, you are charged overage rates available at deepai.org/pricing. Also includes an ad-free experience and API access. Renews automatically until canceled. Non-refundable.
Subtotal
Total due today

Payment

Add DeepAI credits
DeepAI credits
One-time purchase. Credits are added to your wallet after payment.
Subtotal
Total due today

Payment