Leslie Valiant

E69521

academic computer scientist researcher

Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.

Try in SPARQL Jump to: Surface forms Disambiguation Statements Elicitation Referenced by

All labels observed (2)

Label	Occurrences
Leslie Valiant canonical	7
Leslie G. Valiant	1

How this entity was disambiguated

This entity first appeared as the object of triple T439348 — 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: Leslie Valiant
Context triple: [Harold Pender Award, notableRecipient, Leslie Valiant]

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. 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.
C. J Strother Moore
J Strother Moore is an American computer scientist best known for his pioneering work in automated theorem proving and formal methods, including co-developing the Boyer–Moore theorem prover and the ACL2 system.
D. Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
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.

NED2 Entity disambiguation (via description) gpt-5-mini-2025-08-07

Target entity: Leslie Valiant
Target entity description: Leslie Valiant is a renowned computer scientist known for his foundational work in computational learning theory, complexity theory, and artificial intelligence.

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. 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.
C. J Strother Moore
J Strother Moore is an American computer scientist best known for his pioneering work in automated theorem proving and formal methods, including co-developing the Boyer–Moore theorem prover and the ACL2 system.
D. Michael Sipser
Michael Sipser is an American theoretical computer scientist known for his influential work in computational complexity theory and for authoring a widely used textbook on the theory of computation.
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 (47)

Predicate	Object
instanceOf	academic ⓘ computer scientist ⓘ researcher ⓘ
academicAdvisor	Michael S. Paterson ⓘ surface form: Michael Paterson
awardReceived	EATCS Award ⓘ Harvard College Professorship ⓘ surface form: Harvard University teaching awards Donald E. Knuth Prize ⓘ surface form: Knuth Prize NeurIPS Test of Time Award ⓘ Turing Award ⓘ
citizenship	United Kingdom ⓘ
countryOfBirth	United Kingdom ⓘ
educatedAt	Imperial College London ⓘ Cambridge University ⓘ surface form: University of Cambridge University of Warwick ⓘ
employer	Harvard University ⓘ
familyName	Valiant ⓘ
fieldOfWork	artificial intelligence ⓘ computational complexity theory ⓘ computational learning theory ⓘ computer science ⓘ theoretical computer science ⓘ
givenName	Leslie ⓘ
hasResearchInterest	complexity classes ⓘ evolutionary computation ⓘ learning theory ⓘ machine learning ⓘ neural computation ⓘ parallel algorithms ⓘ
knownFor	Probably Approximately Correct learning (PAC learning) ⓘ Valiant–Vazirani theorem ⓘ Valiant’s theorem on #P-completeness of the permanent ⓘ foundational work in computational learning theory ⓘ theory of evolvability in computational learning ⓘ work in artificial intelligence ⓘ work in complexity theory ⓘ work on circuit complexity ⓘ work on parallel computation ⓘ
languageSpoken	English ⓘ
memberOf	American Academy of Arts and Sciences ⓘ Association for Computing Machinery ⓘ Harvard John A. Paulson School of Engineering and Applied Sciences ⓘ surface form: Harvard University School of Engineering and Applied Sciences National Academy of Sciences ⓘ Royal Society ⓘ
name	Leslie Valiant self-link ⓘ
notableWork	Probably Approximately Correct learning (PAC learning) ⓘ surface form: “A Theory of the Learnable” “Probably Approximately Correct” (book) ⓘ
workPosition	T. Jefferson Coolidge Professor of Computer Science ⓘ

How these facts were elicited

Referenced by (8)

Full triples — surface form annotated when it differs from this entity's canonical label.

Harold Pender Award → notableRecipient → Leslie Valiant ⓘ

Leslie Valiant → name → Leslie Valiant self-link ⓘ

EATCS Award → notableRecipient → Leslie Valiant ⓘ

Probably Approximately Correct learning (PAC learning) → introducedBy → Leslie Valiant ⓘ

subject surface form: Probably Approximately Correct learning

Valiant–Vazirani theorem → namedAfter → Leslie Valiant ⓘ

Valiant–Vazirani theorem → originalAuthors → Leslie Valiant ⓘ

“Probably Approximately Correct” (book) → author → Leslie Valiant ⓘ

subject surface form: Probably Approximately Correct