BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Computational aspects of the proof of Goldbach's Ternary Conjectur
 e - David Platt (Bristol)
DTSTART:20131015T151500Z
DTEND:20131015T161500Z
UID:TALK47273@talks.cam.ac.uk
CONTACT:James Newton
DESCRIPTION:Goldbach's Ternary (or Weak) Conjecture states that all odd nu
 mbers greater than five can be expressed as the sum of three primes and da
 tes from 1742. Helfgott's recent proof relied in part on substantial (but 
 finite!) computer verification both of the conjecture itself and of the Ge
 neralised Riemann Hypothesis. We will describe both computations emphasisi
 ng to what extent they can be regarded as rigorous.
LOCATION:MR13
END:VEVENT
END:VCALENDAR