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 |
Other MS Courses
- CENG 500
- CENG 501
- CENG 502
- CENG 503
- CENG 504
- CENG 505
- CENG 506
- CENG 507
- CENG 508
- CENG 509
- CENG 511
- CENG 512
- CENG 513
- CENG 514
- CENG 515
- CENG 516
- CENG 518
- CENG 521
- CENG 522
- CENG 523
- CENG 524
- CENG 525
- CENG 531
- CENG 532
- CENG 533
- CENG 534
- CENG 541
- CENG 542
- CENG 543
- CENG 544
- CENG 551
- CENG 552
- CENG 555
- CENG 556
- CENG 557
- CENG 561
- CENG 562
- CENG 563
- CENG 564
- CENG 565
- CENG 566
- CENG 590
- CENG 608
- CENG 611
- CENG 612
- CENG 613
- CENG 631
- CENG 632
- CENG 641
- CENG 642
- CENG 643
- CENG 651
- CENG 661
- CENG 662
- CENG 663