in a 1985 paper, three computer scientists—Michael Fischer, Nancy Lynch (my doctoral adviser), and Michael Paterson—proved, through a virtuosic display of mathematical logic, that in an asynchronous system, no distributed algorithm could guarantee that a consensus would always be reached, even if it was sure that at most a single computer might crash.
