Reading the Classics
Soda 689, christos@cs,
Office Hours: Wednesday 5-6pm
Meets: Tuesdays 5:00-7:00pm, in Soda 320.
Course Format: Presentations
by participants and discussion.
Purpose: Classics are written by people, often in
their twenties, who take a good look at their field, are deeply dissatisfied
with an important aspect of the state of affairs, put in a lot of time and
intellectual effort into fixing it, and write their new ideas with
self-conscious clarity. I want all
Berkeley graduate students to read them.
1. Attend all meetings,
read all papers, and participate in the discussion.
2. Present (possibly in a group) one of the classics,
and write a paper about it (including a summary of the presentation and the
Examples of classics:
paper on the Konigsberg bridges
- On computable numbers,
with an application to the Entscheidungsproblem.
Alan Turing 1936
- As We May Think. Vannevar Bush, 1945
- First Draft of the Report
on EDVAC. John von Neumann 1946
Mathematical Theory of Communication. Claude E. Shannon 1948
- The Turing Test paper,
Alan Turing 1950
Games. John Nash, 1951
- 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.
- Edmonds, Jack
, Paths, trees, and flowers, Canadian Journal of
Mathematics, Vol 17, No -, 449-467, 1965
- The NP-completeness
papers: S. A. Cook ; R.M. Karp; and L. Levin, 1971-73.
- Two papers on the
relational model by E.F. Codd: A
Relational Model of Data for Large Shared Data Banks, 1970; and Relational
Completeness of Data Base Sublanguages, 1972.
- New Directions in
Cryptography, Diffie and Hellman, 1976
- Simulating physics with
computers. Feynman, IJTP 21 1982
- Your favorite scholarly
work that influenced deeply the development of computer science here.
PS: Some readings in the
philosophy and history of science