Vladimir Andreyevich Uspensky

Vladimir Andreyevich Uspensky (Russian: Владимир Андреевич Успенский; Vladimir Andreevich Uspensky English transcription; born November 27, 1930 in Moscow ) is a Russian mathematician who deals with mathematical logic and theory of algorithms.

Uspenski studied at the Moscow State University and received his doctorate in 1955 Andrei Kolmogorov ( surgery on recursively enumerable sets ). He was from 1966 professor at the Moscow State University, where he was Head of the Department of Mathematical Logic and Theory of Algorithms (succeeding Kolmogorov itself).

By Eugene Dynkin, he wrote a three-volume book Mathematical Recreations ( Volume 1 Multicolor Problems, Volume 2 Number Theory, Volume 3 wanderings ), which are also published in German in 1955 (VEB Verlag der Wissenschaften, Berlin). They went from a course for students of Moscow State University shows, the Dynkin 1945-1947 and led the Uspenski attended as a student.

Vladimir Uspensky brother is the semiotician Boris Uspensky.

Writings

  • Mathematical Recreations. I.: Multi-color problems with E.B. Dynkin, Berlin 1966
  • Mathematical Recreations. II: Tasks from number theory, with E.B. Dynkin, 3rd revised edition, Berlin 1966
  • Mathematical Recreations. III. : Tasks of probability theory: random walks ( Markov chains), with EB Dynkin, Berlin 1966
  • Some applications of mathematics to mechanics, Pergamon Press, Oxford, 1961
  • Pascal's triangle: Certain applications of mathematics to mechanics, Moscow, 1976 ( English)
  • Post 's machine, Moscow, Mir Publishers, 1983 ( English)
  • Goedel 's incompleteness theorem, in: Theoretical computer science, vol 130, no. 2, 1994, p 239
  • Kolmogorov complexity: recent research in Moscow, 21st International Symposium on Mathematical Foundations of Computer Science ( MFCS ), Krakow, September 1996, Lecture Notes in Computer Science, volume 1113, Springer Verlag 1996 (English )
  • Relations Between Varieties of Kolmogorov Complexities, with A. Shen, in: Mathematical systems theory, 29, no. 3, 1996, p 271
  • Mathematical logic in the former Soviet Union: brief history and current trends, in: 10th International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995 ( English)
  • Mathematical metaphysics of randomness with A. A. Muchnik and A. L. Semenov, in: Theoretical Computer Science, volume 207, no. 2, 1998, pp. 263-318 (English )
  • Why Kolmogorov Complexity? , In Eric Goles, Servet Martinez ( ed.) Complex Systems, Kluwer 2001, p.201
  • Lebesgue measure and gambling with VG Kanovei and T. Linton, in: Sbornik Math, Vol 199, No. 11/ 12, 2008, pp. 1597-1620 (English )
Mathematics Genealogy Project Integrated Authority File
827067
de