University of Birmingham > Talks@bham > Theoretical computer science seminar > Quantitative Tauberian theorems

  Browse A-Z

Log in

System Admin (disabled)details Birmingham usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Quantitative Tauberian theorems

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

If you have a question about this talk, please contact Martin Escardo.

In this talk I seek to achieve two things. First, I aim to give a very concise introduction to modern applied proof theory, without assuming any prior knowledge of this area. Second, I will present some new research of mine in Tauberian theory, including a proof theoretic study of the celebrated Hardy-Littlewood Tauberian theorem.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Contemporary History Seminar Computer Science Distinguished Seminar Data Science and Computational Statistics Seminar

Other talks

TBC Modelling uncertainty in image analysis. Provably Convergent Plug-and-Play Quasi-Newton Methods for Imaging Inverse Problems When less is more - reduced physics simulations of the solar wind Ultrafast, all-optical, and highly efficient imaging of molecular chirality Sensing and metrology activities at NPL, India
 

Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on talks.cam from the University of Cambridge.