University of Cambridge > Talks.cam > Churchill CompSci Talks > The Asynchronous Computability Theorem

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹ️ Information

The Asynchronous Computability Theorem

Download to your calendar using vCal

If you have a question about this talk, please contact Matthew Ireland .

Consensus cannot be achieved in an asynchronous wait-free model, but how could we prove this result? In this talk, we will explore a surprising connection between protocols for distributed systems and concepts in algebraic topology. This provides us with a concise mathematical framework unifying many classical concurrency models, enabling us to reason about concurrency via static combinatorial structures. For this talk, we will use this connection to prove that consensus is impossible in an asynchronous wait-free model.

This talk is part of the Churchill CompSci Talks series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Homerton College, Mary Allan Building, Bouling 8 & 9, Hills Road, Cambridge, CB2 8PQ Sidgwick Site, West Rd, CB3 9DT (Lecture Theatre TBC) Average on Sundays: 7191.36057692 kWh

Other talks

The search for a new population of strong gravitational lenses with JWST Animating urbanism: the demotic multiplicities of seeing cities digitally Afternoon Break Harnessing Radical Reactivity for Molecular Innovation Scattering Plenty: the people who made the modern countryside Topic Film, TV shows for Medical Education, ‘The Wire’ as a case study
 

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