2008 Turing Award Predictions
As usually the ACM's Turing Award winner is announced in February, I decided to do a list of possible recipients:
-Alain Colmerauer - Logic Programming, Constraint Logic Programming, Machine Translation - 198X
-Bruce Lucas, Takeo Kanade - Computer Vision - 198X
-Czeslaw Bylinski - Formal Methods - 198X
-David Parnas - Object Orientation - 197X
-Erich Gamma, Richard Helm, Ralph Johnson and John Vlissides - Design Patterns - 199X
-Gordon Plotkin - Operational Semantics - 197X
-Howard Cunningham - Design Patterns, Wiki, Extreme Programming - 199X
-John Alan Robinson - Automated Theorem Proving, Logic Programming - 198X
-Kent Beck - Extreme Programming, Design Patterns, Test-driven development - 199X
-Michael Gelfond, V Lifschitz - Logic Programming - 198X
-Peter Chen - Entity-Relationship, Computer-Aided Software Engineering - 197X
-Richard Sutton - Reinforcement Learning - 198X
-Ross Quinlan - C4.5, ID3 - 198X
-Rudolf Bayer - B-tree -197X
Do you have any guesses?
My bets:
Leonid Levin - well known for his work in randomness, algorithmic complexity and intractability, average-case complexity, foundations of mathematics and computer science, algorithmic probability, theory of computation, information theory and the NP-completeness theorem.
Vladimir Vapnik - fundamental work in computational learning theory: Empirical Risk Minimization, VC-dimension, Support Vector Machine.