23/04/2016, 16:30 — 17:00 — Abreu Faro Amphitheatre
Daniel Graça, Universidade do Algarve

Computability of the Lorenz attractor

The Lorenz model was first studied by E. N. Lorenz and provides one of the first examples of a candidate of a strange attractor (the Lorenz attractor). The Lorenz attractor is rather difficult to study from a mathematical point of view, and its own existence was listed as one of the century problems by the Fields medalist Steve Smale. To make the analysis of the Lorenz model more amenable, a geometric model was introduced and it was recently shown in 2002 by Tucker that the Lorenz system behaves like the geometric model and hence has a strange attractor. In this talk we will analyze the geometric Lorenz model from a computability perspective and show that its associated strange attractor is computable, thus showing that the Lorenz attractor is also computable. We will also show that the Lorenz attractor has an associated computable measure.