BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Monads\, comonads and resource-limited computation - Adam Ó Congh
 aile
DTSTART:20191114T141500Z
DTEND:20191114T151500Z
UID:TALK134641@talks.cam.ac.uk
CONTACT:Johannes Bausch
DESCRIPTION: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 the
 se category-theoretic constructions have been used to model computation wi
 th 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 m
 odel theory and how this comonad structure led to some new and interesting
  questions for complexity theorists.\n\n[1] Abramsky\, S.\, Dawar\, A.\, &
  Wang\, P. (2017). The pebbling comonad in finite model theory. https://do
 i.org/10.17863/CAM.12732
LOCATION:MR9\,  Centre for Mathematical Sciences\, Wilberforce Road\, Camb
 ridge
END:VEVENT
END:VCALENDAR