01 JAN 2010 by ideonexus
Fundamental Names in Computer Science
Consider some fundamental names: Turing (computation theory and programmable automata), von Neumann (computer architecture), Shannon (information theory), Knuth, Hoare, Dijkstra, and Wirth (programming theory and algorithmics), Feigenbaum and McCarthy (artificial intelligence), Codd (relational model of databases), Chen (entity-relationship model), Lamport (distributed systems), Zadeh (fuzzy logic), Meyer (object-oriented programming), Gamma (design patterns), Cerf (Internet), Berners-Lee (WW...Folksonomies: theoretical vs experimental
Folksonomies: theoretical vs experimental
1 
notes
notesThe author uses this list as proof that computer science can be an inductive discipline, but a list of successes is useless for this argument. All of these "fundamental names" are such because their theories were proven in the real world. It's a selective list. We need to see a list of all theorists and then gauge how well induction works versus empiricism.
It does make a good list of big names and their contributions.
