1996 anniversaries:
- G. J. Chaitin. On the length of programs for computing finite binary
sequences, J. Assoc. Comput. Mach. 13(1966),547-569.
- A. M. Turing. On computable numbers, with an application to the
Entscheidungsproblem, Proc. Lond. Math. Soc. (ser. 2)
42 (1936), 230-265; a correction 43 (1936), 544-546.
Two lectures on the history of theoretical computer
science. Click
here to get a copy of the slides. Here are two
suggested essays.
More sites on the history of computer
science:
- LogicAL
: Logic through History
- THE HISTORY OF COMPUTING
- History of Computer Science
- The Virtual Museum of Computing
- History of Mathematics
- The Collection of Computer Science Bibliographies
- TCS
Genealogy