We will discuss some basic problems in distributed computing, such as the ''consensus'' and ''renaming'' problems. We will then show how questions about these problems can be translated into questions about the existence of certain maps between naturally associated simplicial complexes. Algebraic topology can sometimes rule out the existence of such maps and can therefore give impossibility results for distributed and concurrent computation. This talk is based primarily on the work of Maurice Healihy.