Albert R. Meyer

Albert R. Meyer's picture


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.


  • Stockmeyer, L. and A.R. Meyer, ``Cosmological lower bound on the circuit complexity of a small problem in logic,'' JACM 49, 6 (2002), 753-784.
  • Jim, T. and A.R. Meyer, "Full Abstraction and the Context Lemma," SIAM J. Computation 25, 3 (1996), 663--696.
  • Bruce, K.B., A.R. Meyer and J.C. Mitchell, "The Semantics of Second-Order Lambda Calculus," Information and Computation, 85 (1990), 76--134. Reprinted in: Gerard Huet, editor. LOGICAL FOUNDATIONS OF FUNCTIONAL PROGRAMMING, chapter 10, pp213--272. University of Texas at Austin Year of Programming Series. Addison-Wesley Publishing Company, 1990.
  • Mayr, E. and A.R. Meyer, " The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals," Advances in Mathematics, 46,3 (1982), 305--329.
  • Stockmeyer, L. and A.R. Meyer, "Word Problems Requiring Exponential Time," 5th ACM Symp. on Theory of Computing, (May, 1973), 1--10.


  • Association for Computing Machinery: Fellow (1999)
  • American Academy of Arts and Sciences: Fellow (1987)