Yuri Matiyasevich

E838583

Yuri Matiyasevich is a Russian mathematician best known for his negative solution to Hilbert’s tenth problem, showing that no general algorithm exists to determine whether arbitrary Diophantine equations have integer solutions.

All labels observed (1)

Label Occurrences
Yuri Matiyasevich canonical 3

How this entity was disambiguated

Statements (47)

Predicate Object
instanceOf human
mathematician
associatedWithConcept Diophantine representation of recursively enumerable sets
undecidability of Diophantine equations
associatedWithProblem Hilbert’s tenth problem GENERATED
collaboratedWith Hilary Putnam NERFINISHED
Julia Robinson NERFINISHED
Martin Davis NERFINISHED
contributedTo theory of Diophantine representations of recursively enumerable sets
countryOfCitizenship Russia NERFINISHED
era 20th-century mathematics
21st-century mathematics
familyName Matiyasevich NERFINISHED
fieldOfWork computability theory
mathematical logic
mathematics
number theory
gender male
givenName Yuri NERFINISHED
hasInfluenceOn computational number theory
foundations of mathematics
theory of algorithms
hasNotableTheorem Matiyasevich’s theorem NERFINISHED
hasResearchTopic Diophantine definability
Hilbert’s problems NERFINISHED
algorithmic unsolvability
impact completed the work of Davis, Putnam, and Robinson on Hilbert’s tenth problem
influencedField computability theory
logic in computer science
number theory
isSubjectOf studies in the history of Hilbert’s tenth problem
knownFor showing that no general algorithm exists to determine whether arbitrary Diophantine equations have integer solutions
languageOfWorkOrName Russian
Matiyasevich’s theorem states that every recursively enumerable set of natural numbers is Diophantine
name Yuri Matiyasevich NERFINISHED
nationality Russian
notableAchievement proof that Hilbert’s tenth problem is undecidable
notableFor negative solution to Hilbert’s tenth problem
notableWork solution of Hilbert’s tenth problem
occupation mathematician
proved that every recursively enumerable set is Diophantine
that there is no algorithm to decide solvability of arbitrary Diophantine equations in integers
researchArea Diophantine equations NERFINISHED
recursively enumerable sets
undecidability
solved Hilbert’s tenth problem (in the sense of proving its unsolvability) NERFINISHED
theoremNamedAfter Matiyasevich’s theorem NERFINISHED

How these facts were elicited

Referenced by (3)

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

Hilbert’s tenth problem solvedBy Yuri Matiyasevich
Hilbert’s tenth problem inspiredWorkBy Yuri Matiyasevich