BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The way of the empty proof - Jean-Louis Lassez
DTSTART:20191011T130000Z
DTEND:20191011T140000Z
UID:TALK128332@talks.cam.ac.uk
CONTACT:Anuj Dawar
DESCRIPTION:There is a strong conceptual link between proofs and algorithm
 s and their eventual simplicity. With the right data structures algorithms
  become simpler\, sometimes much simpler. With the right definitions proof
 s become simpler to the point where they might vanish. But there is a dark
  side to simplicity. If you find a simple proof or a simple algorithm\, it
  may be dismissed as being “simple”\, even if it is new and interestin
 g. The challenge is to find a simple proof or a simple algorithm that brin
 gs a solution to a hard problem. Examples are drawn from Automata Theory a
 pplied to Theater\, word equations arising from Lie Algebras\, coding theo
 ry as applied to the genetic code. And a striking example where a graphic 
 visualization of Symbolic Gaussian elimination leads to a better understan
 ding of Ershov’s theorem and Perron Frobenius’ theorem as most relevan
 t to Google’s search engine. In Linear programming and Geometry we have 
 major theorems and algorithms and open problems which can be viewed in muc
 h simpler ways using an old elimination algorithm due to Fourier\, when we
  understand the link between Fourier elimination and Gaussian elimination\
 , when inequalities are in fact implicit equalities.
LOCATION:FW26
END:VEVENT
END:VCALENDAR