Turing Universality of the Incompressible Euler Equations and a Conjecture of Moore

DOI10.1093/imrn/rnab233OpenAlexW3155356420WikidataQ113819056 ScholiaQ113819056MaRDI QIDQ5058540

Robert Cardona, Eva Miranda, Daniel Peralta-Salas

Publication date: 21 December 2022

Published in: International Mathematics Research Notices (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Euler equations (35Q31) Classical models of computation (Turing machines, etc.) (68Q04)

Related Items (3)

Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines ⋮ Looking at Euler flows through a contact mirror: universality and undecidability ⋮ Universality of Euler flows and flexibility of Reeb embeddings

This page was built for publication: Turing Universality of the Incompressible Euler Equations and a Conjecture of Moore