BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Can everything be computed? On the Solvability Complexity Index an
 d towers of algorithm. - Anders Hansen (University of Cambridge)
DTSTART:20130117T150000Z
DTEND:20130117T160000Z
UID:TALK42522@talks.cam.ac.uk
CONTACT:Carola-Bibiane Schoenlieb
DESCRIPTION:In this talk we will discuss some of the foundations of comput
 ational mathematics. In particular\, I will ask the rather fundamental que
 stions: "Can everything be computed?" and: "In what way?" and discuss poss
 ible ways to answer them. This is done by linking some new developments in
  computational mathematics (in particular the Solvability Complexity Index
  and towers of algorithms) to some of the fundamental works of Godel\, McM
 ullen and Smale.
LOCATION:MR 14\, CMS
END:VEVENT
END:VCALENDAR