Lecture: Meta arguments

Date: 2/27/17

Reading

• Required reading: Social Processes and Proofs of Theorems and Programs, Richard A. De Milo, Richard J. Lipton, Alan Perlis, Communications of the ACM, 1979.
• Required reading: Letters to the Editor, Concerned Computer Scientists, Communications of the ACM, 1979. Please read the letters by Lamport and Mauer. The rest are optional.
• Optional reading: More Debate Please, Moshe Y. Vardi, Communications of the ACM, 2010.
• Required reading: Another Look at Automated Theorem Proving II, Neal Koblitz, ePrint 2011/485, 2011. You can choose to skip Section 3. In general, the arguments are more important than the specific math in the cryptographic discussions.