Computing with Infinite Data

Funder

Organizational Unit

Publications

The set of hyperbolic equilibria and of invertible zeros on the unit ball is computable

Publication . Graça, Daniel; Zhong, Ning

In this note, we construct an algorithm that, on input of a description of a structurally stable planar dynamical flow $f$ defined on the closed unit disk, outputs the exact number of the (hyperbolic) equilibrium points and their locations with arbitrary accuracy. By arbitrary accuracy it is meant that any accuracy required by the input can be achieved. The algorithm can be further extended to a root-finding algorithm that computes the exact number of zeros as well the location of each zero of a continuously differentiable function $f$ defined on the closed unit ball of $\mathbb{R}^{d}$, provided that the Jacobian of $f$ is invertible at each zero of $f$; moreover, the computation is uniform in $f$.

2021Journal article

Restricted access

Computability of differential equations

Publication . Graça, Daniel; Zhong, Ning

In this chapter, we provide a survey of results concerning the computability and computational complexity of differential equations. In particular, we study the conditions which ensure computability of the solution to an initial value problem for an ordinary differential equation (ODE) and analyze the computational complexity of a computable solution. We also present computability results concerning the asymptotic behaviors of ODEs as well as several classically important partial differential equations.

2021Book part

Open access

Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines

Publication . Graça, Daniel; Zhong, Ning

In this paper, we analyze the problem of finding the minimum dimension n such that an analytic map/ordinary differential equation over R n can simulate a Turing machine in a way that is robust to perturbations. We show that one-dimensional analytic maps are sufficient to robustly simulate Turing machines; but the minimum dimension for the analytic ordinary differential equations to robustly simulate Turing machines is two, under some reasonable assumptions. We also show that any Turing machine can be simulated by a two-dimensional C ∞ ordinary differential equation on the compact sphere S 2.

2022Journal article

Open access

Computing the exact number of periodic orbits for planar flows

Publication . Graça, Daniel; Zhong, Ning

In this paper, we consider the problem of determining the exact number of periodic orbits for polynomial planar flows. This problem is a variant of Hilbert's 16th problem. Using a natural definition of computability, we show that the problem is noncomputable on the one hand and, on the other hand, computable uniformly on the set of all structurally stable systems defined on the unit disk. We also prove that there is a family of polynomial planar systems which does not have a computable sharp upper bound on the number of its periodic orbits.

2022Journal article

Open access

Computability of ordinary differential equations

Publication . Graça, Daniel; Zhong, Ning

In this paper we provide a brief review of several results about the computability of initial-value problems (IVPs) defined with ordinary differential equations (ODEs). We will consider a variety of settings and analyze how the computability of the IVP will be affected. Computational complexity results will also be presented, as well as computable versions of some classical theorems about the asymptotic behavior of ODEs.

2018Book part

Open access