About

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.

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