Category: Computer science; computer history; computer classics; computer science reader; algorithms; software; software engineering; computer survey; computer systems; science anthology; artificial intelligence; mathematics of computer science; Computer science history; origins of computer science; Aristotle; syllogism; logic; Leibniz; calculus; binary arithmetic; Ada Lovelace; Charles Babbage; Luigi Menabrea; difference engine; George Boole; Boolean logic; propositional calculus; David Hilbert; Hilbert’s problems; Diophantine equations; Alan Turing; Turing machine; uncomputability; decision problem; Howard Aiken; Mark I computer; Harvard; IBM; Harvard architecture; Claude Shannon; Boolean logic; simplifying circuits; Warren McCulloch; Walter Pitts; McCulloch-Pitts neuron; threshold logic; John von Neumann; von Neumann architecture; Eckert-Mauchly Computer ;Hamming code; Richard Hamming; error-correcting code; Hamming distance; Corporation; Arthur Burks; Herman; Goldstine; Vannevar Bush; memex; associative memory; Claude Shannon; information theory; bit; entropy; Alan Turing; Turing test; artificial intelligence; Maurice Wilkes; microprogram; microcode; Grace Murray Hopper; compiler; Univac; Joseph Kruskal; Kruskal’s algorithm; greedy algorithm; minimum spanning tree; Frank Rosenblatt; neural net; Norbert Wiener; cybernetics; machine learning; computer ethics; J. C. R. Licklider; human-computer interaction; HCI; John McCarthy; LISP; list structure; metacircular interpreter; Douglas Engelbart; HCI; human-computer interaction; mother of all demos; Fernando Corbató; IBM 7090; Grace Hopper; John Backus; CTSS; Multics; Ivan Sutherland; light pen; computer graphics; constraint programming;Gordon Moore; Moore’s law; exponential growth; Edsger Dijkstra; concurrent programming; Joseph Weizenbaum; chatbot; Edsger Dijkstra; semaphores; synchronization; mutual exclusion; structured programming; Volker Strassen; matrix multiplication; divide and conquer algorithm; C. A. R. Hoare; program correctness; program verification; Hoare logic; Edgar Codd; relational database; relational algebra; Winston Royce; waterfall model; software engineering; Stephen Cook; satisfiability; SAT; nondeterminism; NP-completeness; P vs. NP; Karen Spärck Jones; indexing; inverse document frequency; IDF; Richard Karp; NP-complete; satisfiability; nondeterminism; Dennis Ritchie; Kenneth Thompson; shell; Multics; Vinton Cerf; Robert Kahn; ARPANet; Internet; computer network; TCP/IP; Internet protocol; packet switching; Barbara Liskov; Stephen Zilles; object-oriented programming; Frederick Brooks; Brooks’s law; Robert Metcalfe; David Boggs; computer networks; Whitfield Diffie; Martin Hellman; public-key cryptography; Donald E. Knuth; algorithm analysis; big-O notation; Richard DeMillo; Richard Lipton; Alan Perlis; program verification; Ronald Rivest; Adi Shamir; Len Adleman; public-key cryptography; RSA algorithm; Adi Shamir