Juris Hartmanis
E518232
Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Juris Hartmanis canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5335947 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Juris Hartmanis Context triple: [EATCS Award, notableRecipient, Juris Hartmanis]
-
A.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
B.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
C.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Michael Rabin
Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
-
E.
Moshe Y. Vardi
Moshe Y. Vardi is a prominent computer scientist known for his influential work in logic in computer science, database theory, and automated verification.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Juris Hartmanis Target entity description: Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
-
A.
Manuel Blum
Manuel Blum is a Venezuelan-American computer scientist and Turing Award laureate renowned for his foundational contributions to computational complexity theory and cryptography.
-
B.
Richard Karp
Richard Karp is a renowned American computer scientist best known for his foundational work in computational complexity theory and combinatorial algorithms, including the theory of NP-completeness.
-
C.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
D.
Michael Rabin
Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
-
E.
Moshe Y. Vardi
Moshe Y. Vardi is a prominent computer scientist known for his influential work in logic in computer science, database theory, and automated verification.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
Latvian American person
ⓘ
human ⓘ theoretical computer scientist ⓘ |
| academicDegree | PhD in mathematics ⓘ |
| awardReceived |
Fellow of the American Academy of Arts and Sciences
ⓘ
Fellow of the Association for Computing Machinery NERFINISHED ⓘ Guggenheim Fellowship ⓘ Member of the National Academy of Engineering ⓘ Member of the National Academy of Sciences ⓘ Turing Award ⓘ |
| citizenship | United States of America ⓘ |
| countryOfBirth | Latvia NERFINISHED ⓘ |
| countryOfDeath | United States of America ⓘ |
| dateOfBirth | 1928-07-05 ⓘ |
| dateOfDeath | 2022-07-29 ⓘ |
| doctoralAdvisor | Robert P. Dilworth NERFINISHED ⓘ |
| doctoralThesisTitle | Theory of partial algebras ⓘ |
| doctoralThesisYear | 1955 ⓘ |
| educatedAt |
California Institute of Technology
ⓘ
University of Kansas NERFINISHED ⓘ University of Marburg NERFINISHED ⓘ |
| employer |
Cornell University
ⓘ
General Electric Research Laboratory NERFINISHED ⓘ |
| familyName | Hartmanis NERFINISHED ⓘ |
| fieldOfWork |
computational complexity theory
ⓘ
computer science ⓘ theoretical computer science ⓘ |
| givenName | Juris NERFINISHED ⓘ |
| influenced |
development of complexity classes
ⓘ
formal study of computational resources ⓘ |
| knownFor |
Hartmanis–Stearns theorem
NERFINISHED
ⓘ
founding work in computational complexity theory ⓘ time hierarchy theorem NERFINISHED ⓘ |
| languageSpoken |
English
ⓘ
Latvian ⓘ |
| memberOf |
American Academy of Arts and Sciences
ⓘ
Association for Computing Machinery NERFINISHED ⓘ National Academy of Engineering ⓘ National Academy of Sciences ⓘ |
| notableStudent | Dexter Kozen NERFINISHED ⓘ |
| placeOfBirth | Riga NERFINISHED ⓘ |
| placeOfDeath | Ithaca, New York NERFINISHED ⓘ |
| positionHeld |
director of the National Science Foundation Division of Computer and Computation Research
ⓘ
founding chair of the Cornell computer science department ⓘ professor of computer science at Cornell University ⓘ |
| TuringAwardFor | fundamental contributions to the theory of computational complexity ⓘ |
| TuringAwardSharedWith | Richard E. Stearns NERFINISHED ⓘ |
| TuringAwardYear | 1993 ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Juris Hartmanis Description of subject: Juris Hartmanis was a pioneering computer scientist best known for co-founding the field of computational complexity theory and sharing the 1993 Turing Award for his fundamental contributions.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.