The Turing Award presented to Juris Hartmanis in 1993 formally acknowledged his role in establishing the mathematical foundations of computational complexity theory. Throughout his career, this Latvian-born scientist defined how computational problems are categorized by the time and space required to solve them, fundamentally shaping the trajectory of modern computer science research and academic department development.
Early Life and Academic Foundation
Born in Riga in 1928, Juris Hartmanis eventually relocated to the United States after spending time in Germany. He pursued graduate studies at the University of Missouri–Kansas City, receiving a master's degree in applied mathematics in 1951. He completed his formal education at the California Institute of Technology in 1955, earning a Ph.D. under the supervision of Robert P. Dilworth. His early career included teaching roles at Cornell University and Ohio State University before he joined the General Electric Research Laboratory in 1958.
Twenty questions, eight minutes on the clock, and a percentile measured against everyone who has taken it. No sign-up.
Take the IQ test →Computational Complexity Theory
During his tenure at General Electric, Hartmanis collaborated with Richard E. Stearns to formalize the study of computational complexity. Their work introduced the classification of problems based on computational time, establishing the Time hierarchy theorem. With P.M. Lewis II, Hartmanis expanded these concepts to include space usage, contributing to early insights regarding deterministic space complexity. In later decades, he explored the structure of NP-complete sets and defined the Boolean hierarchy, influencing the broader understanding of computational limits.
Institutional Leadership and Advocacy
Hartmanis returned to Cornell University in 1965, where he served as a professor and became the inaugural head of one of the world's first computer science departments. He maintained a strong commitment to the growth of the discipline, chairing a significant National Research Council study titled Computing the Future, published in 1992. Between 1996 and 1998, he served as assistant director of the Directorate of Computer and Information Science and Engineering at the National Science Foundation.
Recognition and Professional Membership
Over the course of his career, Hartmanis was elected to the National Academy of Engineering, the National Academy of Sciences, and the American Academy of Arts and Sciences. He held fellowships with the Association for Computing Machinery and the American Mathematical Society. His native country honored his scientific contributions with the Grand Medal of the Latvian Academy of Sciences in 2001. He remained an active member of the international research community until his death in 2022.
Fast facts
- Born: 1928, Riga
- Died: 2022
- Turing Award recipient: 1993
- Citizenship: United States; Latvia
- Ph.D. institution: California Institute of Technology
- Primary field: Computational complexity theory
- National Academy of Engineering election: 1989
- Academic home: Cornell University
Questions readers ask
What is the primary contribution of Juris Hartmanis to computer science?
He established the foundations of computational complexity theory, which classifies problems based on the time and space resources required to solve them.
Did Hartmanis receive academic recognition from his country of birth?
Yes, he was a member of the Latvian Academy of Sciences and received their Grand Medal in 2001.
Achievements
- Turing Award — 1993
- Affiliated with Cornell University, General Electric and Ohio State University
- Educated at California Institute of Technology, Massachusetts Institute of Technology and University of Marburg
- Worked as mathematician, computer scientist and university teacher
