Soda 689, christos@cs, (510) 642-1559
Office Hours: Mondays 5-6pm
Meets: Tuesdays 5:00-7:00pm, in Soda 320.
Course Format: Presentations by participants and discussion.
1. Attend all meetings, read the paper before the meeting, and participate in the discussion.
Present (possibly in a group) one of the papers, and write a paper about it (including a summary of the presentation and the discussion). The paper is due one week after the presentation.
Examples of classics:
Euler's paper on the Konigsberg bridges; do you know of a translation? (or Latin?)
The Turing Test paper, Alan Turing 1950
Letter from Gödel to von Neumann, 1956; see J. Hartmanis's "Godel, von Neumann and the P=?NP problem," Bulletin of the European Association for Theoretical Computer Science (EATCS), 38 (1989), pp. 101--107.
Edmonds, Jack , Paths, trees, and flowers, Canadian Journal of Mathematics, Vol 17, No -, 449-467, 1965
Three papers on NP-completeness: S. A. Cook The complexity of theorem-proving procedures, 1971 STOC; R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, 1972; and Levin, Universal Search Problems. [Problemy Peredatsi Informatsii] 9(3):265-266, 1973 (c). Annals of the History of Computing 6(4):384-400, 1984.
Two papers on the relational model
Simulating physics with computers. Feynman, IJTP 21 1982
Your favorite classic here
Readings in the philosophy and history of science