The following pages link to Laurent Bienvenu (Q277526):
Displayed 50 items.
- Coherent randomness tests and computing the \(K\)-trivial sets (Q277530) (← links)
- A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points (Q418118) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Diagonally non-computable functions and fireworks (Q515575) (← links)
- How powerful are integer-valued martingales? (Q693070) (← links)
- Constructive dimension and Turing degrees (Q733739) (← links)
- Randomness and lowness notions via open covers (Q764270) (← links)
- Kolmogorov-Loveland stochasticity and Kolmogorov complexity (Q968271) (← links)
- Constructive equivalence relations on computable probability measures (Q1032627) (← links)
- Layerwise computability and image randomness (Q1694009) (← links)
- Algorithmic identification of probabilities is hard (Q1747492) (← links)
- Strong reductions in effective randomness (Q1758164) (← links)
- Limit complexities revisited (Q1959396) (← links)
- On low for speed oracles (Q2009647) (← links)
- Randomness and semimeasures (Q2013389) (← links)
- Bad oracles in higher computability and randomness (Q2022778) (← links)
- The axiomatic power of Kolmogorov complexity (Q2453066) (← links)
- Algorithmic tests and randomness with respect to a class of measures (Q2510759) (← links)
- Relativized depth (Q2686103) (← links)
- Generic algorithms for halting problem and optimal machines revisited (Q2800974) (← links)
- Denjoy, Demuth and density (Q2878781) (← links)
- Random Semicomputable Reals Revisited (Q2891300) (← links)
- (Q2904792) (← links)
- Separations of non-monotonic randomness notions (Q2907050) (← links)
- (Q2917340) (← links)
- CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS (Q2921009) (← links)
- COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS (Q2925324) (← links)
- Algorithmic Identification of Probabilities Is Hard (Q2938725) (← links)
- On zeros of Martin-Löf random Brownian motion (Q2941095) (← links)
- $$\textit{K}$$-trivial, $$\textit{K}$$-low and $${{\mathrm{\textit{MLR}}}}$$-low Sequences: A Tutorial (Q2947163) (← links)
- Parallel and Serial Jumps of Weak Weak König’s Lemma (Q2970959) (← links)
- Von Neumann's Biased Coin Revisited (Q2986791) (← links)
- (Q3102715) (← links)
- (Q3111440) (← links)
- (Q3113710) (← links)
- (Q3304109) (← links)
- (Q3397654) (← links)
- Constructive Equivalence Relations on Computable Probability Measures (Q3434685) (← links)
- What Percentage of Programs Halt? (Q3448787) (← links)
- (Q3505881) (← links)
- Ergodic-Type Characterizations of Algorithmic Randomness (Q3576190) (← links)
- Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity (Q3590938) (← links)
- ON THE INTERPLAY BETWEEN EFFECTIVE NOTIONS OF RANDOMNESS AND GENERICITY (Q4628689) (← links)
- On the logical strengths of partial solutions to mathematical problems (Q4642696) (← links)
- (Q4910709) (← links)
- Effective Randomness for Computable Probability Measures (Q4921439) (← links)
- SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS (Q5021930) (← links)
- Optimal bounds for single-source Kolmogorov extractors (Q5217889) (← links)
- Continuous higher randomness (Q5268401) (← links)
- DEEP CLASSES (Q5346696) (← links)