Michael Rabin
E199558
Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Michael Rabin canonical | 7 |
| Michael O. Rabin | 4 |
How this entity was disambiguated
This entity first appeared as the object of triple T1762038 — 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.
Target entity: Michael Rabin Context triple: [Adi Shamir, doctoralAdvisor, Michael Rabin]
-
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.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
C.
Elwyn R. Berlekamp
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
-
D.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
E.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
Target entity: Michael Rabin Target entity description: Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
-
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.
Leslie Valiant
Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.
-
C.
Elwyn R. Berlekamp
Elwyn R. Berlekamp was an American mathematician and engineer known for his influential work in coding theory, combinatorial game theory, and algorithms.
-
D.
Leonard Adleman
Leonard Adleman is an American computer scientist and cryptographer best known as one of the co-inventors of the RSA public-key cryptosystem.
-
E.
Martin Davis
Martin Davis was an American mathematician and logician renowned for his foundational work in computability theory and the Entscheidungsproblem, including contributions to the Davis–Putnam algorithm.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
Turing Award laureate
ⓘ
computer scientist ⓘ human ⓘ mathematician ⓘ theoretical computer scientist ⓘ |
| academicDegree | PhD in mathematics ⓘ |
| awardReceived |
EMET Prize
ⓘ
Foreign Honorary Membership of the American Academy of Arts and Sciences ⓘ Harvey Prize ⓘ IEEE John von Neumann Medal ⓘ Israel Prize ⓘ Turing Award ⓘ membership in the National Academy of Sciences ⓘ |
| birthDate | 1931-09-01 ⓘ |
| birthPlace |
Breslau
ⓘ
Weimar Republic ⓘ |
| citizenship | Israel ⓘ |
| coAuthor | Dana Scott ⓘ |
| doctoralAdvisor | Alonzo Church ⓘ |
| educatedAt |
Hebrew University of Jerusalem
ⓘ
Princeton University ⓘ |
| employer |
Harvard University
ⓘ
Hebrew University of Jerusalem ⓘ IBM ⓘ
surface form:
IBM Research
|
| familyName | Rabin ⓘ |
| fieldOfWork |
automata theory
ⓘ
computational complexity theory ⓘ computer science ⓘ cryptography ⓘ distributed computing ⓘ randomized algorithms ⓘ theoretical computer science ⓘ |
| givenName | Michael ⓘ |
| knownFor |
Rabin automaton
ⓘ
Rabin cryptosystem ⓘ Miller primality test ⓘ
surface form:
Rabin–Miller primality test
Rabin–Scott powerset construction ⓘ foundations of randomized computation ⓘ nondeterministic automata ⓘ oblivious transfer ⓘ probabilistic algorithms ⓘ |
| memberOf |
American Academy of Arts and Sciences
ⓘ
Israel Academy of Sciences and Humanities ⓘ National Academy of Sciences ⓘ |
| name | Michael Oser Rabin ⓘ |
| notableWork |
Finite Automata and Their Decision Problems
ⓘ
How to Exchange Secrets by Oblivious Transfer ⓘ Miller primality test ⓘ
surface form:
Probabilistic Algorithm for Testing Primality
|
| positionHeld |
professor of computer science
ⓘ
professor of mathematics ⓘ |
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.
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.
Subject: Michael Rabin Description of subject: Michael Rabin is an Israeli computer scientist and Turing Award laureate renowned for his foundational contributions to automata theory, cryptography, and randomized algorithms.
Referenced by (11)
Full triples — surface form annotated when it differs from this entity's canonical label.