Harry R. Lewis

Harvard College Professor; Gordon McKay Professor of Computer Science

A.B., 1968, A.M., 1973, Ph.D., 1974, Applied Mathematics, Harvard University



Theoretical computer science has its roots in mathematical logic. In the 1930s, using mathematical automata, Turing investigated whether the truth of mathematical propositions could be determined by algorithmic procedures; since then, studies of formalized computers and formalized mathematical systems have continued to complement and enrich one another. Professor Lewis has worked extensively on the algorithmic solvability of logical, computational, and combinatorial systems, attempting to clarify the relations between them and to identify their common characteristics.

Professor Lewis is actively involved in the use of computers in education, and his books have had a significant influence on the teaching of the foundations of computer science to undergraduates.


See Also: Personal Web Page