BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:What is an Algorithm? - Yuri Gurevich\, Microsoft Research Redmond
 \, USA
DTSTART:20160209T160000Z
DTEND:20160209T170000Z
UID:TALK64164@talks.cam.ac.uk
CONTACT:Ohad Kammar
DESCRIPTION:The title problem is of obvious interest to theorists. We will
  explain its importance to software engineering\, in particular to specifi
 cation\, testing and verification of software and hardware.\n\nWasn't the 
 problem solved by Turing? No. Of course Turing's contribution was pivotal\
 , but the problem remained open\, even for sequential algorithms.\nWe argu
 e that problem cannot be solved in full generality because the notion of a
 lgorithm is still evolving. But certain species of algorithms have matured
  sufficiently to become amenable to foundational analysis. This applies fi
 rst of all to sequential algorithm.\n\nIn the main part of the lecture we 
 formalize the notion of sequential algorithms in full generality. Then we 
 will mention the other species of algorithms that have been formalized in 
 full generality. Finally\, we will describe some applications of this rese
 arch\, in particular at Microsoft.
LOCATION:SW01
END:VEVENT
END:VCALENDAR