skip to content
 

"No We Can't": Impossibility of efficient leader election by chemical reactions

Presented by: 
David Doty University of California, Davis
Date: 
Tuesday 5th April 2016 - 11:00 to 11:45
Venue: 
INI Seminar Room 1
Abstract: 
Co-author: David Soloveichik (University of Texas, Austin)

Suppose a chemical system requires a single molecule of a certain species $L$. Preparing a solution with just a single copy of $L$ is a difficult task to achieve with imprecise pipettors. Could we engineer artificial reactions (a chemical election algorithm, so to speak) that whittle down an initially large count of $L$ to 1? Yes, with the reaction $L+L \to L+F$: whenever two candidate leaders encounter each other, one drops out of the race. In volume $v$ convergence to a single $L$ requires expected time proportional to $v$; the final reaction --- two lone $L$'s seeking each other in the vast expanse of volume $v$ --- dominates the whole expected time.

One might hope that more cleverly designed reactions could elect a leader more quickly. We dash this hope: $L+L \to L+F$, despite its sloth, is the fastest chemical algorithm for leader election there is (subject to some reasonable constraints on the reactions). The techniques generalize to establish lower bounds on the time required to do other computational tasks, such as computing which of two species $X$ or $Y$ holds an initial majority.


Democracy works... but it's painstakingly slow.

Related Links



The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons