Kenneth Regan
E583432
Kenneth Regan is an American mathematician and computer scientist known for his work in computational complexity theory and for his research on detecting cheating in chess.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Kenneth Regan canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T6316954 — 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: Kenneth Regan Context triple: [Richard Lipton, coAuthor, Kenneth Regan]
-
A.
Richard Lipton
Richard Lipton is an American computer scientist known for his influential work in theoretical computer science and cryptography, including contributions to complexity theory and algorithm design.
-
B.
W. Craig Jelinek
W. Craig Jelinek is an American business executive best known for serving as the CEO of Costco Wholesale Corporation.
-
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.
Brad Dechter
Brad Dechter is an American orchestrator and arranger known for his work on numerous film scores, including major animated features.
-
E.
Jack Schwartz
Jack Schwartz was an American mathematician and computer scientist known for his contributions to programming languages, parallel computing, and the development of the SETL language.
- 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: Kenneth Regan Target entity description: Kenneth Regan is an American mathematician and computer scientist known for his work in computational complexity theory and for his research on detecting cheating in chess.
-
A.
Richard Lipton
Richard Lipton is an American computer scientist known for his influential work in theoretical computer science and cryptography, including contributions to complexity theory and algorithm design.
-
B.
W. Craig Jelinek
W. Craig Jelinek is an American business executive best known for serving as the CEO of Costco Wholesale Corporation.
-
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.
Brad Dechter
Brad Dechter is an American orchestrator and arranger known for his work on numerous film scores, including major animated features.
-
E.
Jack Schwartz
Jack Schwartz was an American mathematician and computer scientist known for his contributions to programming languages, parallel computing, and the development of the SETL language.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
chess player
ⓘ
human ⓘ mathematician ⓘ university professor ⓘ |
| academicDegree | Doctor of Philosophy in mathematics ⓘ |
| basedIn |
Buffalo, New York
ⓘ
linked to:
Buffalo
|
| blogCoauthor | Richard Lipton ⓘ |
| coauthorOfBlog |
Gödel’s Lost Letter and P=NP
ⓘ
linked to:
blog "Gödel’s Lost Letter and P=NP"
|
| countryOfCitizenship | United States of America ⓘ |
| developed | statistical model comparing human moves to engine choices ⓘ |
| doctoralAdvisor |
Albert Meyer
ⓘ
linked to:
Albert R. Meyer
Stephen Cook ⓘ |
| educatedAt |
Caltech
ⓘ
linked to:
California Institute of Technology
Princeton University ⓘ University of Oxford ⓘ |
| employer |
State University of New York at Buffalo
ⓘ
linked to:
University at Buffalo
University at Buffalo ⓘ |
| fieldOfWork |
algorithmic information theory
ⓘ
chess cheating detection ⓘ computational complexity theory ⓘ computer science ⓘ mathematics ⓘ |
| hasAcademicSpecialization |
algorithm analysis
ⓘ
complexity theory ⓘ theoretical computer science ⓘ |
| hasBlog |
Gödel’s Lost Letter and P=NP
ⓘ
linked to:
blog "Gödel’s Lost Letter and P=NP"
|
| hasRole |
chess analyst
ⓘ
researcher ⓘ teacher ⓘ |
| knownFor |
research on detecting cheating in chess
ⓘ
work in computational complexity theory ⓘ |
| languageSpoken | English ⓘ |
| memberOf |
American Mathematical Society
ⓘ
Association for Computing Machinery ⓘ |
| notableFor | expert testimony in chess cheating investigations ⓘ |
| notableWork |
models of human chess strength and performance
ⓘ
statistical methods for detecting computer assistance in chess games ⓘ |
| occupation | associate professor ⓘ |
| plays | chess ⓘ |
| researchInterest |
Kolmogorov complexity
ⓘ
P versus NP problem ⓘ applications of complexity theory to games ⓘ resource-bounded measure ⓘ |
| teachesAt | Department of Computer Science and Engineering, University at Buffalo ⓘ |
| title | FIDE Master ⓘ |
| uses | computer chess engines for statistical comparison ⓘ |
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: Kenneth Regan Description of subject: Kenneth Regan is an American mathematician and computer scientist known for his work in computational complexity theory and for his research on detecting cheating in chess.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.