BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:8520@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20250520T110000
DTEND;TZID=Europe/Paris:20250520T120000
DTSTAMP:20250512T130211Z
URL:https://www.i2m.univ-amu.fr/evenements/blanc/
SUMMARY:Manon Blanc (Université Paris Saclay): Characterisations of polyno
 mial-time and -space complexity classes over the reals
DESCRIPTION:Manon Blanc: Many recent works have studied how analogue comput
 ational models work\, compared to classical digital ones. By “analogue
 ” models of computation\, we mean computing over continuous quantities\,
  while “digital” models work on discrete structures. This led to a bro
 ader use of Ordinary Differential Equation (ODE) in computability theory. 
 From this point of view\, the field of implicit complexity has also been w
 idely studied and developed. We show here\, using arguments from computabl
 e analysis\, that we can algebraically characterise PTIME and PSPACE for f
 unctions over the reals. We will use discrete ODEs first\, and then we wil
 l show that we can use continuous ODEs. Also\, we will see how we can rela
 te polynomial space with the reachability in dynamical systems.
CATEGORIES:Séminaire,Ernest
LOCATION:I2M Luminy - TPR2\, Salle de Séminaire 304-306 (3ème étage)\, 1
 63 Avenue de Luminy\, Marseille\, 13009\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=163 Avenue de Luminy\, Mars
 eille\, 13009\, France;X-APPLE-RADIUS=100;X-TITLE=I2M Luminy - TPR2\, Sall
 e de Séminaire 304-306 (3ème étage):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20250330T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR