BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:The Asynchronous Computability Theorem - Hei Li\, Churchill Colleg
 e
DTSTART:20220119T190000Z
DTEND:20220119T193000Z
UID:TALK168506@talks.cam.ac.uk
CONTACT:Matthew Ireland
DESCRIPTION:Consensus cannot be achieved in an asynchronous wait-free mode
 l\, but how could we prove this result? In this talk\, we will explore a s
 urprising connection between protocols for distributed systems and concept
 s in algebraic topology. This provides us with a concise mathematical fram
 ework unifying many classical concurrency models\, enabling us to reason a
 bout concurrency via static combinatorial structures. For this talk\, we w
 ill use this connection to prove that consensus is impossible in an asynch
 ronous wait-free model.\n
LOCATION:Wolfson Hall\, Churchill College
END:VEVENT
END:VCALENDAR