Vladimir A. Uspensky

According to our database, Vladimir A. Uspensky authored at least 8 papers between 1979 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

The Lattice of Definability. Origins, Recent Developments, and Further Directions.

Alexei L. Semenov, Sergey Soprunov, Vladimir A. Uspensky

Proceedings of the Computer Science - Theory and Applications, 2014

2003

Do stronger definitions of randomness exist?

Bruno Durand, Vladimir Kanovei, Vladimir A. Uspensky, Nikolai K. Vereshchagin

Theor. Comput. Sci., 2003

1998

Mathematical Metaphysics of Randomness.

Andrei A. Muchnik, Alexei L. Semenov, Vladimir A. Uspensky

Theor. Comput. Sci., 1998

1996

Relations Between Varieties of Kolmogorov Complexities.

Vladimir A. Uspensky, Alexander Shen

Math. Syst. Theory, 1996

Kolmogorov Complexity: Recent Research in Moscow.

Vladimir A. Uspensky

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1994

Gödel's Incompleteness Theorem.

Vladimir A. Uspensky

Theor. Comput. Sci., 1994

1992

Kolmogorov and Mathematical Logic.

Vladimir A. Uspensky

J. Symb. Log., 1992

1979

What are the gains of the theory of algorithms: Basis developments connected with the concept of algorithm and with its application in mathematics.

Vladimir A. Uspensky, Alexei L. Semenov

Proceedings of the Algorithms in Modern Mathematics and Computer Science, 1979