BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Numerically verified proofs in pure maths - Daniel Platt\, Imperia
 l College London
DTSTART:20260420T113000Z
DTEND:20260420T120000Z
UID:TALK245266@talks.cam.ac.uk
CONTACT:Sam Nallaperuma-Herzberg
DESCRIPTION:What’s a numerically verified proof? In pure maths we want t
 o prove theorems\, usually using pen and paper. On the other side there ex
 ist hundreds of very elaborate ways to approximately solve equations\, for
  example physics-informed neural networks. Due to the advent of greater co
 mputational power it has recently become possible to use such approximate 
 solutions in a theorem proofs. In the talk\, I’ll explain how that works
  in a toy example and then briefly mention some applications of this in pu
 re maths.
LOCATION:SS03 Seminar Room\, Willam Gates building (Department of Computer
  Science and Technology)
END:VEVENT
END:VCALENDAR
