Dana Scott

Dana S. Scott, Hillman University Professor of Computer Science, Philosophy, and Mathematical Logic

Important contrutions include early work into Automata Theory (ACM Turing award), and independence of the Boolean Prime Ideal Theorem, and Axiom of Choice. His domain theory models computation and approximation.

Homepage: http://www-2.cs.cmu.edu/~scott/