| Publication | Date of Publication | Type |
|---|
| Martingales in the Study of Randomness | 2023-09-11 | Paper |
| Andrei Kolmogorov and Leonid Levin on Randomness | 2023-09-11 | Paper |
| Relativized depth | 2023-02-24 | Paper |
| SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS | 2022-01-17 | Paper |
| Relativized depth | 2021-12-08 | Paper |
| Probabilistic vs deterministic gamblers | 2021-12-08 | Paper |
| Some Questions of Uniformity in Algorithmic Randomness | 2021-11-02 | Paper |
| Bad oracles in higher computability and randomness | 2021-04-29 | Paper |
| On low for speed oracles | 2020-08-05 | Paper |
| Optimal bounds for single-source Kolmogorov extractors | 2020-02-26 | Paper |
| On low for speed oracles | 2019-11-29 | Paper |
| On the interplay between effective notions of randomness and genericity | 2019-03-15 | Paper |
| On the logical strengths of partial solutions to mathematical problems | 2018-05-25 | Paper |
| Algorithmic identification of probabilities is hard | 2018-05-08 | Paper |
| Layerwise computability and image randomness | 2018-02-01 | Paper |
| Randomness and semimeasures | 2017-08-17 | Paper |
| Continuous higher randomness | 2017-06-20 | Paper |
| Deep \(\Pi_1^0\) classes | 2017-05-26 | Paper |
| Von Neumann's biased coin revisited | 2017-05-16 | Paper |
| Parallel and Serial Jumps of Weak Weak König’s Lemma | 2017-04-04 | Paper |
| Diagonally non-computable functions and fireworks | 2017-03-16 | Paper |
| Coherent randomness tests and computing the \(K\)-trivial sets | 2016-05-02 | Paper |
| Generic algorithms for halting problem and optimal machines revisited | 2016-04-19 | Paper |
| What percentage of programs halt? | 2015-10-27 | Paper |
| \(K\)-trivial, \(K\)-low and MLR-low sequences: a tutorial | 2015-09-22 | Paper |
| Solovay functions and their applications in algorithmic randomness | 2015-08-31 | Paper |
| On zeros of Martin-Löf random Brownian motion | 2015-01-22 | Paper |
| Algorithmic identification of probabilities is hard | 2015-01-14 | Paper |
| Computuing \(K\)-trivial sets by incomplete random sets | 2014-10-21 | Paper |
| Characterizing lowness for Demuth randomness | 2014-09-30 | Paper |
| Denjoy, Demuth and density | 2014-09-05 | Paper |
| Algorithmic tests and randomness with respect to a class of measures | 2014-08-04 | Paper |
| The axiomatic power of Kolmogorov complexity | 2014-06-06 | Paper |
| From bi-immunity to absolute undecidability | 2014-04-04 | Paper |
| Joining non-low C.E. sets with diagonally non-computable functions | 2014-04-01 | Paper |
| Effective randomness for computable probability measures | 2013-05-10 | Paper |
| Limit complexities revisited | 2013-03-19 | Paper |
| How powerful are integer-valued martingales? | 2012-12-07 | Paper |
| Strong reductions in effective randomness | 2012-11-08 | Paper |
| Separations of non-monotonic randomness notions | 2012-09-28 | Paper |
| Separations of non-monotonic randomness notions | 2012-09-05 | Paper |
| The Denjoy alternative for computable functions | 2012-08-23 | Paper |
| Random semicomputable reals revisited | 2012-06-15 | Paper |
| A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points | 2012-05-24 | Paper |
| Kolmogorov complexity and solovay functions | 2012-04-24 | Paper |
| Limit complexities revisited [once more] | 2012-04-01 | Paper |
| Randomness and lowness notions via open covers | 2012-03-13 | Paper |
| Solovay functions and \(K\)-triviality | 2012-01-23 | Paper |
| What is a random number? Chance and computability. | 2012-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3102715 | 2011-12-07 | Paper |
| Effective randomness, strong reductions and Demuth's theorem | 2011-10-09 | Paper |
| Limit complexities revisited | 2010-10-06 | Paper |
| How powerful are integer-valued martingales? | 2010-07-29 | Paper |
| Ergodic-Type Characterizations of Algorithmic Randomness | 2010-07-29 | Paper |
| Kolmogorov-Loveland stochasticity and Kolmogorov complexity | 2010-05-05 | Paper |
| Constructive equivalence relations on computable probability measures | 2009-10-26 | Paper |
| Constructive dimension and Turing degrees | 2009-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3397654 | 2009-09-22 | Paper |
| A simple proof of Miller-Yu theorem | 2008-06-11 | Paper |
| Reconciling Data Compression and Kolmogorov Complexity | 2007-11-28 | Paper |
| The Dynamics of Cellular Automata in Shift-Invariant Topologies | 2007-11-28 | Paper |
| Constructive Dimension and Weak Truth-Table Degrees | 2007-11-13 | Paper |
| Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity | 2007-09-03 | Paper |
| Constructive Equivalence Relations on Computable Probability Measures | 2007-05-02 | Paper |
| Bridging Computational Notions of Depth | N/A | Paper |
