Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
From MaRDI portal
Publication:5220248
Cites work
- Algorithms and Randomness
- AN ELEMENTARY EXPOSITION OF GODEL'S INCOMPLETENESS THEOREM
- Axiomatic approach to the theory of algorithms and relativized computability
- Can an individual sequence of zeros and ones be random?
- Classes of Recursively Enumerable Sets and Their Decision Problems
- Effective operations on partial recursive functions
- Gödel numberings of partial recursive functions
- Gödel's incompleteness theorem
- scientific article; zbMATH DE number 412149 (Why is no real title available?)
- scientific article; zbMATH DE number 3113504 (Why is no real title available?)
- scientific article; zbMATH DE number 3116597 (Why is no real title available?)
- scientific article; zbMATH DE number 3146798 (Why is no real title available?)
- scientific article; zbMATH DE number 3985203 (Why is no real title available?)
- scientific article; zbMATH DE number 3177198 (Why is no real title available?)
- scientific article; zbMATH DE number 3792118 (Why is no real title available?)
- scientific article; zbMATH DE number 3455216 (Why is no real title available?)
- scientific article; zbMATH DE number 3497900 (Why is no real title available?)
- scientific article; zbMATH DE number 6859905 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3056104 (Why is no real title available?)
- scientific article; zbMATH DE number 3110189 (Why is no real title available?)
- Kolmogorov Complexity and Algorithmic Randomness
- Mathematical metaphysics of randomness
- On completely recursively enumerable classes and their key arrays
- On the definition of an algorithm
- Reducibility and Completeness for Sets of Integers
This page was built for publication: Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5220248)