University of Birmingham > Talks@bham > Lab Lunch > Monotone complexity from a logical viewpoint

  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

Monotone complexity from a logical viewpoint

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

If you have a question about this talk, please contact Anupam Das.

Following on from Gianluca’s lab lunch series, I want to speak about a line of work on characterising monotone computation using notions from mathematical logic, in particular recursion theory and proof theory.

[NB: this talk will be physical only]

This talk is part of the Lab Lunch series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Type the title of a new list here Type the title of a new list here Facts and Snacks

Other talks

Quantifying the economic and environmental effects of the RCEP Parameter estimation for macroscopic pedestrian dynamics models using trajectory data Stochastic quantisation of gauge theories Kolmogorov-Smirnov type testing for structural breaks: A new adjusted-range based self-normalization approach TBA Sylow branching coefficients for symmetric groups
 

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.