This is a follow-up from my post about synchronous work. (There was some interesting discussion on Hacker News.)

Marius Eriksen tweeted me the slides for a talk by Tony Hoare that talks about how concurrent programs see reduced wait times, or “wait faster.”

The money slide:

(At this point you should be wondering what the probability distribution for arrival time is. That’s explained in the very next slide.)