Publications (45)
K-trivial, K-low and MLR-low sequences: a tutorial
Laurent Bienvenu, Alexander Shen
Limit complexities revisited
Laurent Bienvenu, Andrej Muchnik, Alexander Shen +1
Algorithms and Geometric Constructions
Vladimir Uspenskiy, Alexander Shen
Dimension 1 sequences are close to randoms
Noam Greenberg, Joe Miller, Alexander Shen +1
Complex Tilings
Bruno Durand, Leonid A. Levin, Alexander Shen
Fixed-point tile sets and their applications
Bruno Durand, Andrei Romashchenko, Alexander Shen
Probability-free pricing of adjusted American lookbacks
A. Philip Dawid, Steven de Rooij, Peter Grunwald +5
Axiomatic approach to the theory of algorithms and relativized computability
Alexander Shen
Game arguments in computability theory and algorithmic information theory
Andrej Muchnik, Alexander Shen, Mikhail Vyugin
Algorithmic Information Theory and Foundations of Probability
Alexander Shen
1D Effectively Closed Subshifts and 2D Tilings
Durand Bruno, Alexander Shen, Andrei Romashchenko
Conditional probabilities and van Lambalgen theorem revisited
Bruno Bauwens, Alexander Shen, Hayato Takahashi
Variations on Muchnik's Conditional Complexity Theorem
Daniil Musatov, Andrei Romashchenko, Alexander Shen
An additivity theorem for plain Kolmogorov complexity
Bruno Bauwens, Alexander Shen
Test Martingales, Bayes Factors and $p$-Values
Glenn Shafer, Alexander Shen, Nikolai Vereshchagin +1
The axiomatic power of Kolmogorov complexity
Laurent Bienvenu, Andrei Romashchenko, Alexander Shen +2
Fixed Point and Aperiodic Tilings
Bruno Durand, Andrei Romashchenko, Alexander Shen
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Laurent Bienvenu, Adam Day, Mathieu Hoyrup +2
Fixed point theorem and aperiodic tilings
Bruno Durand, Andrei Romashchenko, Alexander Shen
Priority arguments and separation problems
Alexander Shen
Rod in a train: a mechanical problem of H.Whitney, or Much Ado About Nothing
Alexander Shen
Algorithmic statistics revisited
Nikolay Vereshchagin, Alexander Shen
Insuring against loss of evidence in game-theoretic probability
A. Philip Dawid, Steven de Rooij, Glenn Shafer +3
Limit complexities revisited [once more]
Laurent Bienvenu, Andrej Muchnik, Alexander Shen +1
Kolmogorov complexity as a language
Alexander Shen
Decomposition Complexity
Alexander Shen
Game interpretation of Kolmogorov complexity
Andrej A. Muchnik, Ilya Mezhirov, Alexander Shen +1
Algorithmic identification of probabilities is hard
Laurent Bienvenu, Santiago Figueira, Benoit Monin +1
On the structure of Ammann A2 tilings
Bruno Durand, Alexander Shen, Nikolay Vereshchagin
Compressibility and probabilistic proofs
Alexander Shen
Complexity of complexity and strings with maximal plain and prefix Kolmogorov complexity
Bruno Bauwens, Alexander Shen
Algorithmic statistics: forty years later
Nikolai Vereshchagin, Alexander Shen
Hilbert's Error?
Alexander Shen
Random noise increases Kolmogorov complexity and Hausdorff dimension
Gleb Posobin, Alexander Shen
Topological arguments for Kolmogorov complexity
Alexander Shen, Andrei Romashchenko
Layerwise computability and image randomness
Laurent Bienvenu, Mathieu Hoyrup, Alexander Shen
Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma
Andrei Rumyantsev, Alexander Shen
Random semicomputable reals revisited
Laurent Bienvenu, Alexander Shen
Not Every Domain of a Plain Decompressor Contains the Domain of a Prefix-Free One
Mikhail Andreev, Ilya Razenshteyn, Alexander Shen
Plain stopping time and conditional complexities revisited
Mikhail Andreev, Gleb Posobin, Alexander Shen
Generic algorithms for halting problem and optimal machines revisited
Laurent Bienvenu, Damien Desfontaines, Alexander Shen
Around Kolmogorov complexity: basic notions and results
Alexander Shen
Are random axioms useful?
Alexander Shen
Effective closed subshifts in 1D can be implemented in 2D
Bruno Durand, Andrei Romashchenko, Alexander Shen
Algorithmic tests and randomness with respect to a class of measures
Laurent Bienvenu, Peter Gacs, Mathieu Hoyrup +2