Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
From MaRDI portal
Publication:5220248
DOI10.1070/RM9875zbMath1435.01015OpenAlexW2971899393MaRDI QIDQ5220248
A. Kh. Shen', Yu. S. Osipov, S. I. Adyan, V. A. Plungyan, E. V. Rakhilina, M. R. Pentus, S. G. Tatevosov, Vladimir M. Tikhomirov, A. L. Semenov, Yuri L. Ershov, Lev D. Beklemishev, Sergei S. Goncharov, Yu. V. Matiyasevich, Nikolai Andreev, Victor A. Sadovnichij
Publication date: 11 March 2020
Published in: Russian Mathematical Surveys (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/rm9875
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Axiomatic approach to the theory of algorithms and relativized computability
- Mathematical metaphysics of randomness
- Gödel's incompleteness theorem
- Effective operations on partial recursive functions
- On completely recursively enumerable classes and their key arrays
- Gödel numberings of partial recursive functions
- Can an individual sequence of zeros and ones be random?
- Algorithms and Randomness
- Reducibility and Completeness for Sets of Integers
- AN ELEMENTARY EXPOSITION OF GODEL'S INCOMPLETENESS THEOREM
- Kolmogorov Complexity and Algorithmic Randomness
- On the definition of an algorithm
- Classes of Recursively Enumerable Sets and Their Decision Problems
This page was built for publication: Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)