Computability and Beltrami fields in Euclidean space

DOI10.1016/J.MATPUR.2022.11.007MaRDI QIDQ2109116zbMATH OpenOpenAlexFDO

Authors Robert Cardona, Eva Miranda, Daniel Peralta-Salas

Publication date 20 December 2022

Published in Journal de Mathématiques Pures et Appliquées. Neuvième Série (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.03559

zbMATH Keywords

Beltrami fieldscomputational complexityEuler equationsTuring machines

Mathematics Subject Classification ID

Existence problems for PDEs: global existence, local existence, non-existence (35A01) Cauchy-Kovalevskaya theorems (35A10) Boundary value problems for systems of nonlinear higher-order PDEs (35G60) Euler equations (35Q31) Topological entropy (37B40) Spectral theory; eigenvalue problems on manifolds (58C40) Classical models of computation (Turing machines, etc.) (68Q04) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Existence, uniqueness, and regularity theory for incompressible inviscid fluids (76B03)

Abstract: In this article, we pursue our investigation of the connections between the theory of computation and hydrodynamics. We prove the existence of stationary solutions of the Euler equations in Euclidean space, of Beltrami type, that can simulate a universal Turing machine. In particular, these solutions possess undecidable trajectories. Heretofore, the known Turing complete constructions of steady Euler flows in dimension 3 or higher were not associated to a prescribed metric. Our solutions do not have finite energy, and their construction makes crucial use of the non-compactness of $mathbb{R}^3$, however they can be employed to show that an arbitrary tape-bounded Turing machine can be robustly simulated by a Beltrami flow on $mathbb{T}^3$ (with the standard flat metric). This shows that there exist steady solutions to the Euler equations on the flat torus exhibiting dynamical phenomena of (robust) computational complexity as high as desired. We also quantify the energetic cost for a Beltrami field on $mathbb{T}^3$ to simulate a tape-bounded Turing machine, thus providing additional support for the space-bounded Church-Turing thesis. Another implication of our construction is that a Gaussian random Beltrami field on Euclidean space exhibits arbitrarily high computational complexity with probability $1$. Finally, our proof also yields Turing complete flows and diffeomorphisms on $mathbb{S}^2$ with zero topological entropy, thus disclosing a certain degree of independence within different hierarchies of complexity.

Recommendations

• Computability on Regular Subsets of Euclidean Space
• Computability Results Used in Differential Geometry
• Computability Theory and Differential Geometry
• Computing Beltrami Fields
• Computability and the Connes embedding problem
• scientific article; zbMATH DE number 1285742
• scientific article; zbMATH DE number 800363
• Euclidean functions of computable Euclidean domains
• Computable fields and the bounded Turing reduction

Cites work

• Approximation of a Function and its Derivatives by Entire Functions of Several Variables
• Beltrami fields exhibit knots and chaos almost surely
• Chaos in the incompressible Euler equation on manifolds of high dimension
• Computability with low-dimensional dynamical systems
• Computability with polynomial differential equations
• Computation with perturbed dynamical systems
• Distance to C^k hypersurfaces
• Entropy of continuous flows on compact 2-manifolds
• Generalized shifts: unpredictability and undecidability in dynamical systems
• scientific article; zbMATH DE number 1460545 (Why is no real title available?)
• Knots and links in steady solutions of the Euler equation
• Knotted structures in high-energy Beltrami fields on the torus and the sphere
• Liouville theorem for Beltrami flow
• Machines, Computations, and Universality
• New Computational Paradigms
• Non-computable Julia sets
• On the universality of potential well dynamics
• On the universality of the incompressible Euler equation on compact manifolds
• On the universality of the incompressible Euler equation on compact manifolds. II. Non-rigidity of Euler flows
• Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines
• Some undecidable problems about the trace-subshift associated to a Turing machine
• The Cauchy problem in spaces of entire functions
• The topological entropy of iterated piecewise affine maps is uncomputable
• Tight space-noise tradeoffs in computing the ergodic measure
• Unpredictability and undecidability in dynamical systems

Cited in

(12)

• Singular cotangent models in fluids with dissipation
• Computing Beltrami Fields
• Turing Universality of the Incompressible Euler Equations and a Conjecture of Moore
• Computing Euclidean Belyi maps
• Universality of Euler flows and flexibility of Reeb embeddings
• Singular cotangent models in fluids with dissipation
• Steady Euler flows on \({\mathbb{R}}^3\) with wild and universal dynamics
• Towards a fluid computer
• Undecidability in physics: a review
• On the algorithmic descriptive complexity of attractors in topological dynamics
• Hydrodynamic and symbolic models of computation with advice
• Topological entropy of Turing complete dynamics

This page was built for publication: Computability and Beltrami fields in Euclidean space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2109116)