Albert R. Meyer
Prof. Meyer has been at MIT since 1969. He is best known for his contributions to computational complexity theory, including the formulation of the POLYNOMIAL-TIME HIERARCHY and the first proofs of the exponential complexity of known decision problems. He has contributed extensively to Type Theory and Semantics of programming languages and concurrent processes. As an outgrowth of his recent responsibility for several large introductory courses, he has become interested in educational technology.
Prof. Meyer has supervised twenty-six Ph.D students, many now prominent researchers on the faculty of leading departments throughout the country. He is a member of numerous professional societies and editorial boards, is a member of the American Academy of Arts and Science, and is Editor-in-Chief of the journal Information and Computation.
( CSAIL members only )