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
Sources
1. Wikipedia: Juris Hartmanis
Wikimedia FoundationLead sectionQuote, 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.
Juris Hartmanis (Wikidata)
Wikidata alias: J. Hartmanis
J. Hartmanis
Wikidata P166: honorary doctorate
Wikidata P166 (award received): honorary doctorate.
Wikidata P166: Grand Medal of the Latvian Academy of Sciences
Wikidata P166 (award received): Grand Medal of the Latvian Academy of Sciences.
Wikidata P166: Turing Award
Wikidata P166 (award received): Turing Award.
Wikidata P166: ACM Fellow
Wikidata P166 (award received): ACM Fellow.
Wikidata P166: Fellow of the American Academy of Arts and Sciences
Wikidata P166 (award received): Fellow of the American Academy of Arts and Sciences.
Wikidata P166: Fellow of the American Association for the Advancement of Science
Wikidata P166 (award received): Fellow of the American Association for the Advancement of Science.
Wikidata P166: ACM Distinguished Service Award
Wikidata P166 (award received): ACM Distinguished Service Award.
Wikidata P166: Fellow of the American Mathematical Society
Wikidata P166 (award received): Fellow of the American Mathematical Society.
Wikidata P166: honorary doctor of TU Dortmund
Wikidata P166 (award received): honorary doctor of TU Dortmund.
View the SourceReader 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.