![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Glynn Winskel, Computer Laboratory, University of Cambridge
Tuesday 22 November 2011, 14:15-15:15
Concurrent Games
- 👤 Speaker: Glynn Winskel, Computer Laboratory, University of Cambridge
- 📅 Date & Time: Tuesday 22 November 2011, 14:15 - 15:15
- 📍 Venue: MR5, Centre for Mathematical Sciences
Abstract
I will present and motivate recent results on concurrent games. These represent a situation in which a Player (or a team of players) compete against an Opponent (a team of opponents), possibly in a highly distributed fashion. As usual the dichotomy Player vs. Opponent can be interpreted in a variety of ways, as Process vs. Environment, or Proof vs. Refutation. Both games and nondeterministic concurrent strategies are represented by event structures, a `partial-order model’ of computation, with an extra function expressing the polarity (the Player/Opponent nature) of each event. Although this work has grown from the needs of semantics of programming languages – I’ll explain how – I believe it could have much more general interest.
Series This talk is part of the Category Theory Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- Category Theory Seminar
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR5, Centre for Mathematical Sciences
- ndb35's list
- School of Physical Sciences
- yk373's list
Note: Ex-directory lists are not shown.