Yuri Matiyasevich

Yuri Matiyasevich
Yuri Matiyasevich
Born	2 March 1947; Leningrad, Soviet Union
Nationality	Soviet; Russian
Alma mater	Leningrad State University
Known for	his contribution to computability theory, especially solving Hilbert's tenth problem
Awards	Petersburg Mathematical Society Prize (1970),; Markov Prize (1980),; Humboldt Award (1998)
	Scientific career
Fields	Mathematics and Theoretical computer science
Institutions	Petersburg Department of Steklov Institute of Mathematics

Yuri Vladimirovich Matiyasevich, (Russian: Ю́рий Влади́мирович Матиясе́вич; born 2 March 1947 in Leningrad) is a Russian mathematician and computer scientist. He is best known for his negative solution of Hilbert's tenth problem (Matiyasevich's theorem), which was presented in his doctoral thesis at LOMI (the Leningrad Department of the Steklov Institute of Mathematics).

Biography

In 1962–1963, Matiyasevich studied at Saint Petersburg Lyceum 239;
In 1963–1964, he studied at Kolmogorov School; in 1964 was absolute winner of the All-Union Olympiad in mathematics
In 1964–1969, Matiyasevich studied at Mathematics & Mechanics Faculty of Leningrad State University. By qualifying for the USSR team to the International Mathematical Olympiad (where he won a gold medal), Yuri Matiyasevich was accepted without exams to Leningrad State University, skipping the last year of high school studies.
In 1966, he presented a talk at International Congress of Mathematicians held in Moscow. He was a second-year undergraduate student at that time.
In 1967, while working on the word problem for semigroups, he constructed a semigroup with three relations that is undecidable.[1]
In 1969–1970, he pursued doctoral studies at Leningrad Department of Steklov Institute of Mathematics under supervision of Sergey Maslov.
In 1970, he received his doctorate (Candidate degree, equivalent to Ph.D) at LOMIand gave an invited talk at International Congress of Mathematicians held in Nice on Undecidability of Hibert's tenth problem.
In 1970–1974, he was a researcher at LOMI.
In 1972, he obtained a second doctoral degree (equivalent to habilitation or D.Sc, called "doktor nauk" in Soviet Union).
In 1974–1980, he was a senior researcher at LOMI.
In 1980-2018, Yuri Matiyasevich was the head of Laboratory of mathematical logic at LOMI.
Since 1995, he has been a professor of Saint Petersburg State University, initially at the chair of software engineering, later at the chair of algebra and number theory.
In 1997, he was elected as a corresponding member of Russian Academy of Sciences.
Since 1998, Yuri Matiyasevich has been a vice-president of St. Petersburg Mathematical Society.
Since 2002, he has been a head of St.Petersburg City Mathematical Olympiad.
Since 2003, Matiyasevich has been a co-director of annual German–Russian student school JASS.
In 2008, he was elected as a full member of Russian Academy of Sciences.

Awards and honors

1964: Gold medal at the International Mathematical Olympiad held in Moscow.
1970: "Young mathematician prize" of the Leningrad Mathematical Society.[2]
1980: Markov Prize of Academy of Sciences of the USSR.
1996: Honorary Degree, Université d'Auvergne.
1998: He received Humboldt Research Award.
2003: Honorary Degree, Université Pierre et Marie Curie (UPMC).
2007: Member of the Bavarian Academy of Sciences.

Notable facts

A polynomial related to the colorings of a triangulation of a sphere was named after Matiyasevich; see The Matiyasevich polynomial, four colour theorem and weight systems.
He was a member of the American Mathematical Society and the Association for Symbolic Logic; and also of the editorial boards for the journals Discrete Mathematics and Applications and Computer Instruments in Education.
Notable students include: Eldar Musayev, Maxim Vsemirnov, Alexei Pastor, Dmitri Karpov.

Selected works

Book

Yuri Matiyasevich Hilbert's 10th Problem, Foreword by Martin Davis and Hilary Putnam, The MIT Press, 1993. ISBN 0-262-13295-8.

Papers

Yuri Matiyasevich (1973). "Real-time recognition of the inclusion relation" (PDF). Journal of Sovjet Mathematics. 1 (1): 64–70. doi:10.1007/bf01117471. ISSN 0090-4104.
Yuri Matiyasevich, Julia Robinson (1975). "Reduction of an arbitrary Diophantine equation to one in 13 unknowns". Acta Arithmetica. XXVII: 521–549.
Yuri Matiyasevich, Géraud Sénizergues (1996). "Decision Problems for Semi-Thue Systems with a Few Rules". LICS.
Yuri Matiyasevich, Proof Procedures as Bases for Metamathematical Proofs in Discrete Mathematics, Personal Journal of Yury Matiyasevich.
Yuri Matiyasevich, Elimination of bounded universal quantifiers standing in front of a quantifier-free arithmetical formula, Personal Journal of Yuri Matiyasevich.
Yuri Matiyasevich, A Polynomial related to Colourings of Triangulation of Sphere, Personal Journal of Yuri Matiyasevich.
Yuri Matiyasevich (2004). "Some Probabilistic Restatements of the Four Color Conjecture". Journal of Graph Theory. 46 (3): 167–179. doi:10.1002/jgt.10178.

References

Wolfram, Stephen (2002). A New Kind of Science. Wolfram Media, Inc. p. 1141. ISBN 1-57955-008-8.
"SPb. Math. Soc. Prizes". www.mathsoc.spb.ru.

External links

Yuri Matiyasevich's home page.
Yuri Matiyasevich at DBLP.
Hilbert's Tenth Problem: a History of Mathematical Discovery.
Yuri Matiyasevich's results at International Mathematical Olympiad
Matiyasevich theorem on Scholarpedia.
Vita and collaboration with France (in French).
O'Connor, John J.; Robertson, Edmund F., "Yuri Matiyasevich", MacTutor History of Mathematics archive, University of St Andrews.
Supercomputing for a Superproblem: A Computational Journey Into Pure Mathematics

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] Wolfram, Stephen (2002). A New Kind of Science. Wolfram Media, Inc. p. 1141. ISBN 1-57955-008-8.

[2] "SPb. Math. Soc. Prizes". www.mathsoc.spb.ru.