Juris Hartmanis

Walter R. Read Professor of Engineering
Turing Award Winner
Ph.D. California Institute of Technology, 1955

The strategic goal of my research is to contribute to the development of a comprehensive theory of computational complexity. Computational complexity, the study of the quantitative laws that govern computation, is an essential part of the science base needed to guide, harness, and

exploit the explosively growing computer technology. My current research interests focus on understanding the computational complexity of chaotic systems and the classification of undecidable problems in complexity theory.


Computing Research Association Distinguished Service Award, July 2000.

Professional Activities

Member: National Academy of Engineering.

Foreign Member: Latvian Academy of Sciences.

Fellow: American Academy of Arts and Sciences; New York State Academy of Sciences; AAAS. Editor: Springer-Verlag Lecture Notes in Computer Science; Journal of Computer and Systems Sciences; Fundamenta Informaticae.

Advisory Board: EATCS Monographs in Theoretical Computer Science, Springer-Verlag; International Journal of Foundations of Computing.

Member: DIMACS External Advisory Committee.

Member: Yeshiva University Computer Science Review Committee.

University Activities

Local Natural Sciences Research Advisory Council.

Chair: Engineering College Nominating Committee.


Observations about the Nature and State of Computer Science. Keynote Address. ICALP’99, Prague, Czech Republic, July 1999.

Four lectures in Distinguished Lecture Series, New Mexico State University, Las Cruces, NM, October 1999.

—. The P vs. NP Problem.

—. Technology and Computer Science.

—. Observations about the Nature of Computer Science.

—. Computer Science and Washington Science Policy.

Information Technology: Policy and Impact on Universities. Inauguration of Florida State University School of Computational and Information Technology, Tallahassee, FL, November 1999.