Juris Hartmanis was a Latvian-American computer scientist who, together with Richard Stearns, founded the field of computational complexity theory with their 1965 paper classifying problems by the amount of computing time needed to solve them and proving the time-hierarchy theorem, which shows that more computing time genuinely allows more problems to be solved. Hartmanis and Stearns shared the 1993 Turing Award for this founding work.
Facts
AwardGrand Medal of the Latvian Academy of Sciences 2 AwardFellow of the American Academy of Arts and Sciences 2 AwardFellow of the American Association for the Advancement of Science 2 AwardACM Distinguished Service Award 2 AwardFellow of the American Mathematical Society 2 Awardhonorary doctor of TU Dortmund 2 FAQs
What did Juris Hartmanis do for computing beyond his work on complexity theory?
He chaired the National Research Council study behind the 1992 report Computing the Future and later served at the National Science Foundation.
Hartmanis also worked on national direction for the field. He chaired the National Research Council study behind the 1992 publication Computing the Future, which made recommendations to sustain the core effort in computer science and engineering, to broaden the field and to improve undergraduate education in it. From 1996 to 1998 he was assistant director of the National Science Foundation directorate for computer and information science and engineering.
Connections
In Field
Source Wikipedia: Juris Hartmanis
In the Other Atlases
Milestones Credited
Also in Mathematics Atlas: a milestone credited to this subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikipedia: Juris Hartmanis
Wikimedia FoundationLead section
Juris Hartmanis (July 5, 1928 - July 29, 2022) was a Latvian-born American computer scientist and computational theorist who, with Richard E. Stearns, received the 1993 ACM Turing Award "in recognition of their seminal paper which established the foundations for the field of computational complexity theory".
- In Field: Theory of Computation, Lead paragraph
View the Source 2. Wikidata: Juris Hartmanis
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.