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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Monads, comonads and resource-limited computation

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

in person & via zoom FW11, William Gates Building. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Average on Saturdays: 7745.94755245 kWh

Other talks

Title to be confirmed Social values in scientific information: value plurality and the democratic view Science & the Public in Action: Can and should climate scientists be activists? Coming soon Angular analyses of b -> s ee decays at LHCb Title to be confirmed
 

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