Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Yuri Matiyasevich

Also Known As Yury Matiyasevich · Yuri Vladimirovich Matiyasevich · Yury Vladimirovich Matiyasevich
Theory of Computation

Yuri Matiyasevich is a Russian mathematician and computer scientist who, in his 1972 doctoral thesis, completed the negative solution to Hilberts tenth problem, proving that there is no general algorithm for deciding whether an arbitrary Diophantine equation has a solution in integers. His proof, building on earlier work by Julia Robinson, Martin Davis and Hilary Putnam, showed that the set of solvable Diophantine equations coincides with the computably enumerable sets, a result now known as the MRDP theorem that connects number theory directly to the limits of computation.

Facts
Birth Year
1947 1
Birth Date
1947-03-02 1
Nationality
Russian 1
Award
honorary doctorate at the université d'Auvergne - Clermont I 2
Award
Markov Prize 2
Award
doctor honoris causa from the Pierre and Marie Curie University 2
Award
honorary doctor of the Aix-Marseille University 2
Connections

In Field

Source Wikipedia: Yuri Matiyasevich
In the Other Atlases

Nationality

Also in Geography Atlas: the nationality of this subject.

Sources
1. Wikipedia: Yuri Matiyasevich
Wikimedia Foundation
  • Lead section
    Yuri Vladimirovich Matiyasevich (Russian: Ю́рий Влади́мирович Матиясе́вич; born 2 March 1947 in Leningrad) is a Russian mathematician and computer scientist.
  • Lead paragraph, first sentence (after the Russian name gloss)
    is a Russian mathematician and computer scientist.
  • Lead paragraph
    is a Russian mathematician and computer scientist
  • In Field: Theory of Computation, Infobox: known_for
    his contribution to computability theory, especially solving Hilbert's tenth problem, through Matiyasevich's theorem
View the Source
2. Wikidata: Yuri Matiyasevich
Wikidata Q707119, class allow-list match (w-wdresolver-0926)View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.