University of Cambridge > Talks.cam > CQIF Seminar > Monads, comonads and resource-limited computation

Monads, comonads and resource-limited computation

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

If you have a question about this talk, please contact Johannes Bausch.

In this talk, I will introduce the notion of a (co)monad with examples from pure maths and computer science. I will then survey how these category-theoretic constructions have been used to model computation with limited resources in classical and quantum settings. In particular, I will demonstrate how a comonadic construction due to Abramsky, Dawar and Wang [1] gave an elegant representation of the “pebble game” from finite model theory and how this comonad structure led to some new and interesting questions for complexity theorists.

[1] Abramsky, S., Dawar, A., & Wang, P. (2017). The pebbling comonad in finite model theory. https://doi.org/10.17863/CAM.12732

This talk is part of the CQIF Seminar 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