Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Juris Hartmanis

Also Known As J. Hartmanis
Theory of Computation

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
Birth Year
1928 1
Birth Date
1928-07-05 1
Death Year
2022 1
Death Date
2022-07-29 1
Nationality
Latvian-American 1
Award
honorary doctorate 2
Award
Grand Medal of the Latvian Academy of Sciences 2
Award
Turing Award 2
Award
ACM Fellow 2
Award
Fellow of the American Academy of Arts and Sciences 2
Award
Fellow of the American Association for the Advancement of Science 2
Award
ACM Distinguished Service Award 2
Award
Fellow of the American Mathematical Society 2
Award
honorary doctor of TU Dortmund 2
Sources
1. Wikipedia: Juris Hartmanis
Wikimedia FoundationLead section
Quote, Lead 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.
View the Source
2. Wikidata: Juris Hartmanis
Wikidata Q92628, class allow-list match (w-wdresolver-0926)View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.