CENG 517

Classics Works in Computer Science

Gödel’s undecidability theorem, computability, game theory ideas, information theory basics, graphs, networks, new directions in cryptography, the Antikythera mechanism, declarative programming, relational database model, machines and intelligence, computational complexity.

Course Objectives

Knowledge of ideas and basic assumptions inside the classics articles of computer science provides the understanding of the boundaries of the field. This paves the way for advanced research. The objective of the course is thus to provide this necessary background to give new perspectives.

Recommended or Required Reading

D. E. Denning, “A Lattice Model of Secure Information Flow”, Commun. ACM, vol. 19, pp. 236 243, 1976

Learning Outcomes

1. Know the basic assumptions and ideas in computer science

2. Know the scientists who are leading the way in computer science

Topics
Gödel’s Undecidability Theorem
On Computable Numbers, with an Application to the Entscheidungsproblem by Alan M. Turing
Simulating Physics with Computers Richard P. Feynman
Non-Cooperative Games by John Nash
A Mathematical Theory of Communication by Claude E. Shannon
Paths, Trees, and Flowers by Jack Edmonds
New Directions in Cryptography by Whitfield Diffie and Martin E. Hellman
Midterm
As We May Think by Vannevar Bush
Recursive Functions of Symbolic Expressions and Their Computation by Machine by John McCarthy
Computing Machinery and Intelligence by A.M. Turing
A Theory of the Learnable by L.G. Valiant
A Lattice Model of Secure Information Flow by Dorothy E. Denning
In Search of Lost Time Decoding the ancient Greek astronomical calculator known as the Antikythera Mechanism High Tech from Ancient Greece

Grading

Midterm: 30%

Homework: 30%

Final: 40%