The following pages link to Alexander Shen (Q235575):
Displayed 50 items.
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118) (← links)
- Fixed-point tile sets and their applications (Q439933) (← links)
- Insuring against loss of evidence in game-theoretic probability (Q618027) (← links)
- Not every domain of a plain decompressor contains the domain of a prefix-free one (Q620966) (← links)
- Test martingales, Bayes factors and \(p\)-values (Q635415) (← links)
- Variations on Muchnik's conditional complexity theorem (Q639853) (← links)
- Partitioning multi-dimensional sets in a small number of ``uniform'' parts (Q854815) (← links)
- Prequential randomness and probability (Q982633) (← links)
- Semi-integer rectangles (Q1361151) (← links)
- (Q1384700) (redirect page) (← links)
- A strange application of Kolmogorov complexity (Q1384701) (← links)
- Inequalities for Shannon entropy and Kolmogorov complexity (Q1567410) (← links)
- Hilbert's error? (Q1622647) (← links)
- Algorithms and geometric constructions (Q1670771) (← links)
- Automatic Kolmogorov complexity and normality revisited (Q1679997) (← links)
- Dimension 1 sequences are close to randoms (Q1680550) (← links)
- Conditional probabilities and van Lambalgen's theorem revisited (Q1694006) (← links)
- Layerwise computability and image randomness (Q1694009) (← links)
- Algorithmic identification of probabilities is hard (Q1747492) (← links)
- Local rules and global order, or aperiodic tilings (Q1777517) (← links)
- An additivity theorem for plain Kolmogorov complexity (Q1946492) (← links)
- Limit complexities revisited (Q1959396) (← links)
- On the structure of Ammann A2 tilings (Q1985295) (← links)
- Compressibility and probabilistic proofs (Q2011640) (← links)
- Individual codewords (Q2077409) (← links)
- Two characterizations of finite-state dimension (Q2291415) (← links)
- Topological arguments for Kolmogorov complexity (Q2354581) (← links)
- Non-reducible descriptions for conditional Kolmogorov complexity (Q2382285) (← links)
- The axiomatic power of Kolmogorov complexity (Q2453066) (← links)
- Algorithms and programming. Problems and solutions (Q2473625) (← links)
- Algorithmic tests and randomness with respect to a class of measures (Q2510759) (← links)
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited (Q2656172) (← links)
- The Kučera-Gács theorem revisited by Levin (Q2682931) (← links)
- Generic algorithms for halting problem and optimal machines revisited (Q2800974) (← links)
- Around Kolmogorov Complexity: Basic Notions and Results (Q2805718) (← links)
- Algorithmic Statistics Revisited (Q2805729) (← links)
- Random Semicomputable Reals Revisited (Q2891300) (← links)
- Game Arguments in Computability Theory and Algorithmic Information Theory (Q2904462) (← links)
- COMPLEXITY OF COMPLEXITY AND STRINGS WITH MAXIMAL PLAIN AND PREFIX KOLMOGOROV COMPLEXITY (Q2921012) (← links)
- Probabilistic Constructions of Computable Objects and a Computable Version of Lovász Local Lemma (Q2934869) (← links)
- Algorithmic Identification of Probabilities Is Hard (Q2938725) (← links)
- $$\textit{K}$$-trivial, $$\textit{K}$$-low and $${{\mathrm{\textit{MLR}}}}$$-low Sequences: A Tutorial (Q2947163) (← links)
- Algorithmic Statistics: Forty Years Later (Q2970987) (← links)
- Kolmogorov Complexity as a Language (Q3007621) (← links)
- (Q3020324) (← links)
- (Q3397654) (← links)
- What Percentage of Programs Halt? (Q3448787) (← links)
- Complex tilings (Q3503757) (← links)
- (Q3505881) (← links)
- On-Line Probability, Complexity and Randomness (Q3529916) (← links)