These two talks will introduce the main techniques used to prove lower bounds and unsolvability results for distributed computing, including indistinguishability, covering arguments, and valency arguments. No previous knowledge of distributed computing will be assumed.