Question: Anatoly Maltsev and Valentin Turchin were both from Russia, which of the two is known for his work as a mathematician?

full_context: Document 1: Alan Turing: Alan Mathison Turing ( ; 23 June 1912 – 7 June 1954) was an English computer scientist, mathematician, logician, cryptanalyst, philosopher and theoretical biologist.
Document 2: Eugene Maltsev: Eugene Demjanovich Maltsev (Russian: Евгений Демьянович Мальцев ; August 9, 1929, Ryazan Oblast, USSR — December 24, 2003, Saint Petersburg, Russia) was a Soviet Russian painter, People's Artist of the Russian Federation, a member of the Saint Petersburg Union of Artists (before 1992 — the Leningrad Union of the Soviet Artists), who lived and worked in Leningrad. In 1990-1997 Eugene Maltsev was a head of the Saint Petersburg Union of Artists, in 1989-1991 was elected a People's Deputies of the Soviet Union from the USSR Union of Artists. Maltsev regarded as one of representatives of the Leningrad school of painting, most famous for his portrait and historical paintings.
Document 3: Efim Zelmanov: Efim Isaakovich Zelmanov (Russian: Ефи́м Исаа́кович Зе́льманов ; born 7 September 1955 in Khabarovsk) is a Russian-American mathematician, known for his work on combinatorial problems in nonassociative algebra and group theory, including his solution of the restricted Burnside problem. He was awarded a Fields Medal at the International Congress of Mathematicians in Zürich in 1994.
Document 4: Anatoly Maltsev: Anatoly Ivanovich Maltsev (also: Malcev, Mal'cev; Russian: Анато́лий Ива́нович Ма́льцев; 27 November N.S./14 November O.S. 1909, Moscow Governorate – 7 June 1967, Novosibirsk) was born in Misheronsky, near Moscow, and died in Novosibirsk, USSR. He was a mathematician noted for his work on the decidability of various algebraic groups. Malcev algebras (generalisations of Lie algebras) are named after him.
Document 5: Yuri Matiyasevich: Yuri Vladimirovich Matiyasevich, (Russian: Ю́рий Влади́мирович Матиясе́вич ; born March 2, 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).
Document 6: Andrey Kolmogorov: Andrey Nikolaevich Kolmogorov (Russian: Андрей Николаевич Колмогоров ; ] , 25 April 1903 – 20 October 1987) was a 20th-century Soviet mathematician who made significant contributions to the mathematics of probability theory, topology, intuitionistic logic, turbulence, classical mechanics, algorithmic information theory and computational complexity.
Document 7: Eugene Dynkin: Eugene Borisovich Dynkin (Russian: Евге́ний Бори́сович Ды́нкин ; 11 May 1924 – 14 November 2014) was a Soviet and American mathematician. He has made contributions to the fields of probability and algebra, especially semisimple Lie groups, Lie algebras, and Markov processes. The Dynkin diagram, the Dynkin system, and Dynkin's lemma are named after him.
Document 8: Nicolai Reshetikhin: Nicolai Yuryevich Reshetikhin (Russian: Николай Юрьевич Решетихин , born October 10, 1958 in Leningrad, Soviet Union) is a mathematical physicist, currently a professor of mathematics at the University of California, Berkeley and a professor of mathematical physics at the University of Amsterdam. His research is in the fields of low-dimensional topology, representation theory, and quantum groups. His major contributions are in the theory of quantum integrable systems, in representation theory of quantum groups
Document 9: Metacompilation: Metacompilation is a computation which involves metasystem transitions (MST) from a computing machine "M" to a metamachine "M' " which controls, analyzes and imitates the work of "M". Semantics-based program transformation, such as partial evaluation and supercompilation (SCP), is metacomputation. Metasystem transitions may be repeated, as when a program transformer gets transformed itself. In this manner MST hierarchies of any height can be formed. The Fox paper reviews one strain of research which was started in Russia by Valentin Turchin's REFAL system in the late 1960s-early 1970s and became known for the development of supercompilation as a distinct method of program transformation. After a brief description of the history of this research line, the paper concentrates on those results and problems where supercompilation is combined with repeated metasystem transitions.
Document 10: Anatoly Karatsuba: Anatoly Alexeevitch Karatsuba (Russian: Анато́лий Алексе́евич Карацу́ба ; Grozny, Soviet Union, January 31, 1937 – Moscow, Russia, September 28, 2008) was a Russian mathematician working in the field of analytic number theory, "p"-adic numbers and Dirichlet series.
Document 11: Setun: Setun (Russian: Сетунь ) was a computer developed in 1958 at Moscow State University. It was built under the leadership of Sergei Sobolev and Nikolay Brusentsov. It was the most modern ternary computer, using the balanced ternary numeral system and three-valued ternary logic instead of the two-valued binary logic prevalent in other computers. The computer was built to fulfill the needs of Moscow State University. It was manufactured at the Kazan Mathematical plant. Fifty computers were built from 1959 and production was halted in 1965. The characteristic operating memory consisted of 81 words of memory, each word composed of 18 trits (ternary digits) with additional 1944 words on magnetic drum (total of about 7 KB). Between 1965 and 1970, a regular binary computer was used at Moscow State University to replace it. Although this replacement binary computer performed equally well, it had 2.5 times the cost of the Setun. In 1970, a new ternary computer architecture, the Setun-70, was developed; it was implemented only in the form of a simulator program running on a binary computer.
Document 12: Valentin Turchin: Valentin Fyodorovich Turchin (Russian: Валенти́н Фёдорович Турчи́н , 14 February 1931 in Podolsk – 7 April 2010 in Oakland, New Jersey) was a Soviet and American cybernetician and computer scientist. He developed the Refal programming language, the theory of metasystem transitions and the notion of supercompilation. He was as a pioneer in Artificial Intelligence and a proponent of the global brain hypothesis.
Document 13: Nikolay Brusentsov: Nikolay Petrovich Brusentsov (Russian: Никола́й Петро́вич Брусенцо́в ; 7 February 1925 in Kamenskoe, Ukrainian SSR – 4 December 2014) was a Russian computer scientist, most famous for having built a (balanced) ternary computer, Setun, together with Sergei Sobolev in 1958.
Document 14: Francis Heylighen: Francis Paul Heylighen (born 1960) is a Belgian cyberneticist investigating the emergence and evolution of intelligent organization. He presently works as a research professor at the Vrije Universiteit Brussel, the Dutch-speaking Free University of Brussels, where he directs the transdisciplinary research group on "Evolution, Complexity and Cognition" and the Global Brain Institute. He is best known for his work on the Principia Cybernetica Project, his model of the Internet as a Global brain, and his contributions to the theories of memetics and self-organization. He is also known, albeit to a lesser extent, for his work on gifted people and their problems.
Document 15: Super-recursive algorithm: In computability theory, super-recursive algorithms are a generalization of ordinary algorithms that are more powerful, that is, compute more than Turing machines. The term was introduced by Mark Burgin, whose book "Super-recursive algorithms" develops their theory and presents several mathematical models. Turing machines and other mathematical models of conventional algorithms allow researchers to find properties of recursive algorithms and their computations. In a similar way, mathematical models of super-recursive algorithms, such as inductive Turing machines, allow researchers to find properties of super-recursive algorithms and their computations.
ground_truth: Malcev algebras (generalisations of Lie algebras) are named after him.