Geodesic
Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 74 (2019) no. 4, pp. 735-753
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{RM_2019_74_4_a3,
     author = {S. I. Adian and N. N. Andreev and L. D. Beklemishev and S. S. Goncharov and Yu. L. Ershov and Yu. V. Matiyasevich and Yu. S. Osipov and M. R. Pentus and V. A. Plungyan and E. V. Rakhilina and V. A. Sadovnichii and A. L. Semenov and S. G. Tatevosov and V. M. Tikhomirov and A. Kh. Shen},
     title = {Vladimir {Andreevich} {Uspensky} (27/11/1930{\textendash}27/6/2018)},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {735--753},
     year = {2019},
     volume = {74},
     number = {4},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2019_74_4_a3/}
}
TY  - JOUR
AU  - S. I. Adian
AU  - N. N. Andreev
AU  - L. D. Beklemishev
AU  - S. S. Goncharov
AU  - Yu. L. Ershov
AU  - Yu. V. Matiyasevich
AU  - Yu. S. Osipov
AU  - M. R. Pentus
AU  - V. A. Plungyan
AU  - E. V. Rakhilina
AU  - V. A. Sadovnichii
AU  - A. L. Semenov
AU  - S. G. Tatevosov
AU  - V. M. Tikhomirov
AU  - A. Kh. Shen
TI  - Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2019
SP  - 735
EP  - 753
VL  - 74
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/RM_2019_74_4_a3/
LA  - en
ID  - RM_2019_74_4_a3
ER  - 
%0 Journal Article
%A S. I. Adian
%A N. N. Andreev
%A L. D. Beklemishev
%A S. S. Goncharov
%A Yu. L. Ershov
%A Yu. V. Matiyasevich
%A Yu. S. Osipov
%A M. R. Pentus
%A V. A. Plungyan
%A E. V. Rakhilina
%A V. A. Sadovnichii
%A A. L. Semenov
%A S. G. Tatevosov
%A V. M. Tikhomirov
%A A. Kh. Shen
%T Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2019
%P 735-753
%V 74
%N 4
%U http://geodesic.mathdoc.fr/item/RM_2019_74_4_a3/
%G en
%F RM_2019_74_4_a3
S. I. Adian; N. N. Andreev; L. D. Beklemishev; S. S. Goncharov; Yu. L. Ershov; Yu. V. Matiyasevich; Yu. S. Osipov; M. R. Pentus; V. A. Plungyan; E. V. Rakhilina; V. A. Sadovnichii; A. L. Semenov; S. G. Tatevosov; V. M. Tikhomirov; A. Kh. Shen. Vladimir Andreevich Uspensky (27/11/1930–27/6/2018). Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 74 (2019) no. 4, pp. 735-753. http://geodesic.mathdoc.fr/item/RM_2019_74_4_a3/

[1] Страница Р’. Рђ. РЈСЃРїРμРЅСЃРєРѕРіРѕ РЅР° СЃР°РNoС‚Рμ mathnet.ru: \par http://www.mathnet.ru/rus/person20219

[2] Страница Р’. Рђ. РЈСЃРїРμРЅСЃРєРѕРіРѕ РЅР° СЃР°РNoС‚Рμ кафРμРґСЂС‹ матРμматичРμСЃРєРѕРNo логики Рё С‚РμРѕСЂРёРё алгоритмов РјРμС...мата МГУ: \par http://lpcs.math.msu.su/ũspensky/

[3] “Geometricheskii vyvod osnovnykh svoistv garmonicheskikh funktsii”, UMN, 4:2(30) (1949), 201–205 | MR | Zbl

[4] Obschee opredelenie algoritmicheskoi vychislimosti i algoritmicheskoi svodimosti, Dipl. rabota, MGU, mekh.-matem f-t, M., 1952, 90 pp.

[5] Mathematische Unterhaltungen. Aufgaben über das Mehrfarbenproblem, aus der Zahlentheorie und der Wahrscheinlichkeitsrechnung, Aulis Verlag Deubner Co. KG, Cologne, 1979 (with E. B. Dynkin), 272 pp. | MR | MR | Zbl

[6] “O vychislimykh operatsiyakh”, Dokl. AN SSSR, 103:5 (1955), 773–776 | MR | Zbl

[7] “Sistemy perechislimykh mnozhestv i ikh numeratsii”, Dokl. AN SSSR, 105:6 (1955), 1155–1158 | MR | Zbl

[8] Ob operatsiyakh nad perechislimymi mnozhestvami, Diss. ... kand. fiz.-matem. nauk, MGU, mekh.-matem. f-t, M., 1955

[9] “Vychislimye operatsii i ponyatie programmy (rezyume doklada)”, v st. “Zasedaniya Moskovskogo matematicheskogo obschestva”, UMN, 11:4(70) (1956), 172–176

[10] “On the definition of an algorithm”, Amer. Math. Soc. Transl. (2), 29 (1963), 217–245 (with A. N. Kolmogorov) | DOI | MR | MR | Zbl | Zbl

[11] Nekotorye prilozheniya mekhaniki k matematike, Fizmatlit, M., 1958, 48 pp. | Zbl

[12] “K voprosu o sootnoshenii mezhdu razlichnymi sistemami konstruktivnykh deistvitelnykh chisel”, Izv. vuzov. Matem., 1960, no. 2, 199–208 | MR | Zbl

[13] Leçons sur les fonctions calculables, Actualités Sci. Indust., 1317, Hermann, Paris, 1966, 412 pp. | MR | MR | Zbl

[14] Pascal's triangle, Popular Lectures in Math., Univ. Chicago Press, Chicago–London, 1974, vii+35 pp. | Zbl

[15] “An elementary exposition of Godel's incompleteness theorem”, Russian Math. Surveys, 29:1 (1974), 63–106 | DOI | MR | Zbl

[16] Post's machine, Mir, Moscow, 1983, 88 pp. | MR | Zbl

[17] “Gödel's incompleteness theorem”, Theoret. Comput. Sci., 130:2 (1994), 239–319 | DOI | MR | MR | Zbl | Zbl

[18] Nestandartnyi, ili nearkhimedov, analiz, Znanie, M., 1983, 62 pp. | MR

[19] “Matematicheskaya logika v vychislitelnykh naukakh i vychislitelnoi praktike”, Vestn. AN SSSR, 56:7 (1986), 93–103 (with A. L. Semenovym) | MR

[20] Chto takoe nestandartnyi analiz?, Nauka, M., 1987, 128 pp. | MR | Zbl

[21] Algorithms: main ideas and applications, Math. Appl., 251, Kluwer Acad. Publ., Dordrecht, 1993 (with A. Semenov), xii+269 pp. | DOI | MR | MR | Zbl | Zbl

[22] “Algorithms and randomness”, Theory Probab. Appl., 32:3 (1987), 389–412 (with A. N. Kolmogorov) | DOI | MR | Zbl

[23] “Can an individual sequence of zeros and ones be random?”, Russian Math. Surveys, 45:1 (1990), 121–189 (with A. L. Semenov, A. Kh. Shen') | DOI | MR | Zbl

[24] “Mathematical metaphysics of randomness”, Theoret. Comput. Sci., 207:2 (1998), 263–317 (with An. A. Muchnik, A. L. Semenov) | DOI | MR | Zbl

[25] Chto takoe aksiomaticheskii metod?, NITs “Regulyarnaya i khaoticheskaya dinamika”, Izhevsk, 2001, 96 pp.

[26] “Chetyre algoritmicheskikh litsa sluchainosti”, Matem. prosveschenie, ser. 3, 10, MTsNMO, M., 2006, 71–108 | Zbl

[27] Apologiya matematiki, Amfora, SPb., 2009, 554 pp.

[28] Prosteishie primery matematicheskikh dokazatelstv, MTsNMO, M., 2009, 56 pp.

[29] Kolmogorov complexity and algorithmic randomness, Math. Surveys Monogr., 220, Amer. Math. Soc., Providence, RI, 2017 (with A. Shen, N. Vereshchagin), xviii+511 pp. | MR | Zbl

[30] Trudy po nematematike, V pyati knigakh, 2-e izd., ispr. i dop., OGI, “Matematicheskie etyudy”, M.; РєРЅ.\;2, Философия, 2014, 566 СЃ.; \nofrills РєРЅ.\;3, ЯзыкознаниРμ, 2013, 711 СЃ.; РєРЅ.\;4, Филология, 2012, 591 СЃ.; РєРЅ.\;5, Воспоминания Рё наблюдРμРЅРёСЏ, 2018, 1118 СЃ.

[31] Matematika v sovremennom mire, Sb. per., pod red. i s predisl. V. A. Uspenskogo, Mir, M., 1967, 202 pp.

[32] H. Rogers, Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York–Toronto, ON–London, 1967, xx+482 pp. | MR | MR | Zbl | Zbl

[33] A. P. Ershov, V. M. Monakhov (red.), Osnovy informatiki i vychislitelnoi tekhniki, Ch. 1, Prosveschenie, M., 1985, 96 pp.; Р§. 2, 1986, 144 СЃ. | Zbl

[34] R. M. Friedberg, H. Rogers, Jr., “Reducibility and completeness for sets of integers”, Z. Math. Logik Grundlagen Math., 5:7-13 (1959), 117–125 | DOI | MR | Zbl

[35] A. A. Markov, Theory of algorithms, The Israel Program for Scientific Translations, Jerusalem, 1961, iv+444 pp. | MR | MR | Zbl

[36] An. A. Muchnik, “On the basic structures of the descriptive theory of algorithms”, Soviet Math. Dokl., 32 (1985), 671–674 | MR | Zbl

[37] J. Myhill, “A fixed point theorem in recursion theory (abstract)”, in “Eighteenth meeting of the association for symbolic logic”, J. Symbolic Logic, 20:2 (1955), 205 | DOI

[38] J. Myhill, J. C. Shepherdson, “Effective operations in partial recursive functions”, Z. Math. Logik Grundlagen Math., 1 (1955), 310–317 | DOI | MR | Zbl

[39] H. G. Rice, “Classes of recursively enumerable sets and their decision problems”, Trans. Amer. Math. Soc., 74:2 (1953), 358–366 | DOI | MR | Zbl

[40] H. G. Rice, “On completely recursively enumerable classes and their key arrays”, J. Symbolic Logic, 21:3 (1956), 304–308 | DOI | MR | Zbl

[41] H. Rogers, Jr., “Gödel numberings of partial recursive functions”, J. Symbolic Logic, 23:3 (1958), 331–341 | DOI | MR | Zbl

[42] A. Shen, “Axiomatic approach to the theory of algorithms and relativized computability”, Moscow Univ. Math. Bull., 35:2 (1980), 29–32 | MR | Zbl

[43] A. A. Zaliznyak, Russkoe imennoe slovoizmenenie, Nauka, M., 1967, 372 pp.