ACM Turing Award Lectures: The First Twenty Years, 1966 to 1985

algebra ALGOL 60 algorithm analysis application programs argument arithmetic artificial intelligence AST system Boolean Boolean circuit CODASYL combinatorial compiler complexity theory computational complexity computer science concept data structures data sublanguage database management DBMS defined definition efficient elements evaluation example expression field formal FORTRAN FP systems functional forms hardware heuristic ideas implementation important input integrity linear logic lower bounds mathematical matrix method Neumann languages node notation NP-complete numerical analysis objects operations optimal paper paradigm parallel parallel computation physical symbol system polynomial probabilistic problem Proc procedure processing programming languages proof prove Rabin random recursive relational database relational model relational systems representation result rules semantics sequence solution solving space storage syntax theorem tion traveling salesman problem Turing Award Lecture Turing machine University UNIX users variables vector