BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Computability and Zipf's Law: operadic perspective - Manin\, YI (M
 ax-Planck-Institut fur Mathematik\, Bonn)
DTSTART:20130404T123000Z
DTEND:20130404T133000Z
UID:TALK44350@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:The classical model of computability is the theory of partial 
 recursive functions. Church's thesis postulates the "universality" of this
  model\, and a vast corpus of other approaches confirms this thesis. Parti
 al recursive functions is the minimal subset of partial functions containi
 ng a list of elementary functions and stable wrt another list of basic ope
 rations. One part of my talk is dedicated to the operad generated by basic
  operations\, and possibly larger algebras over this operad formalizing al
 so oracle assisted computations. Another part will deal with applications 
 of computability and complexity to the creation of a mathematical model of
  Zipf's law: empirical probability measure observable on a vast amount of 
 data\, starting with distribution of words in texts.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR