![]() |
![]() |
Monotone complexity from a logical viewpointAdd 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. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsCold atoms http://talks.bham.ac.uk/show/index/1942 Physics and Astronomy ColloquiaOther talksTBC Disorder relevance for non-convex random gradient Gibbs measures in d=2 Geometry of alternating projections in metric spaces with bounded curvature Ultrafast, all-optical, and highly efficient imaging of molecular chirality Modelling uncertainty in image analysis. Quantum simulations using ultra cold ytterbium |