Loading…
Constructing Turing complete Euler flows in dimension 3
Can every physical system simulate any Turing machine? This is a classical problem that is intimately connected with the undecidability of certain physical phenomena. Concerning fluid flows, Moore [C. Moore, 4, 199 (1991)] asked if hydrodynamics is capable of performing computations. More recently,...
Saved in:
Published in: | Proceedings of the National Academy of Sciences - PNAS 2021-05, Vol.118 (19), p.1 |
---|---|
Main Authors: | , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Can every physical system simulate any Turing machine? This is a classical problem that is intimately connected with the undecidability of certain physical phenomena. Concerning fluid flows, Moore [C. Moore,
4, 199 (1991)] asked if hydrodynamics is capable of performing computations. More recently, Tao launched a program 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 to quantum-field theories. To the best of our knowledge, the existence of undecidable particle paths of three-dimensional fluid flows has remained an elusive open problem since Moore's works in the early 1990s. In this article, we construct a Turing complete stationary Euler flow on a Riemannian [Formula: see text] and speculate on its implications concerning Tao's approach to the blow-up problem in the Navier-Stokes equations. |
---|---|
ISSN: | 0027-8424 1091-6490 |
DOI: | 10.1073/pnas.2026818118 |