4 papers
Robustness of non-computability
Daniel S. Graça, Ning Zhong
Turing computability is the standard computability paradigm which captures the computational power of digital computers. To understand whether one can create physically realistic d…
Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
Daniel S. Graça, Ning Zhong
In this paper, we analyze the problem of finding the minimum dimension such that a closed-form analytic map/ordinary differential equation can simulate a Turing machine over $\…
Computability of the Solutions to Navier-Stokes Equations via Recursive Approximation
Shu-Ming Sun, Ning Zhong, Martin Ziegler
As one of the seven open problems in the addendum to their 1989 book "Computability in Analysis and Physics", Pour-El and Richards proposed ``... the recursion theoretic study of p…
Computing geometric Lorenz attractors with arbitrary precision
Daniel Graca, Cristobal Rojas, Ning Zhong
The Lorenz attractor was introduced in 1963 by E. N. Lorenz as one of the first examples of \emph{strange attractors}. However Lorenz' research was mainly based on (non-rigourous)…