University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Computability and Zipf's Law: operadic perspective

Computability and Zipf's Law: operadic perspective

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Grothendieck-Teichmller Groups, Deformation and Operads

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. Partial recursive functions is the minimal subset of partial functions containing a list of elementary functions and stable wrt another list of basic operations. One part of my talk is dedicated to the operad generated by basic operations, and possibly larger algebras over this operad formalizing also 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.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2019 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity