| Publication | Date of Publication | Type |
|---|
| Pathwise-randomness and models of second-order arithmetic | 2024-06-21 | Paper |
| Growth and irreducibility in path-incompressible trees | 2024-03-27 | Paper |
| Compression of enumerations and gain | 2023-04-06 | Paper |
| The Kučera-Gács theorem revisited by Levin | 2023-02-01 | Paper |
| Randomness below complete theories of arithmetic | 2023-01-12 | Paper |
| Randomness below complete theories of arithmetic | 2022-06-10 | Paper |
| Aspects of Muchnik's paradox in restricted betting | 2022-01-14 | Paper |
| Irreducibility of enumerable betting strategies | 2021-12-29 | Paper |
| G\'acs-Ku\v{c}era's Theorem Revisited by Levin | 2021-10-31 | Paper |
| The idemetric property: when most distances are (almost) the same | 2021-10-29 | Paper |
| Limits of the Kučera–Gács Coding Method | 2021-06-15 | Paper |
| Granularity of wagers in games and the possibility of saving | 2020-12-15 | Paper |
| Monotonous betting strategies in warped casinos | 2020-03-12 | Paper |
| Compression of Data Streams Down to Their Information Content | 2019-07-19 | Paper |
| Minority population in the one-dimensional Schelling model of segregation | 2018-12-21 | Paper |
| Equivalences between learning of data and probability distributions, and their applications | 2018-09-27 | Paper |
| Pointed computations and Martin-Löf randomness | 2018-09-20 | Paper |
| Digital morphogenesis via Schelling segregation | 2018-05-09 | Paper |
| The Information Content of Typical Reals | 2018-04-18 | Paper |
| Optimal redundancy in computations from random oracles | 2017-11-14 | Paper |
| The Probability of a Computable Output from a Random Oracle | 2017-10-16 | Paper |
| Differences of halting probabilities | 2017-09-07 | Paper |
| Aspects of Chaitin's Omega | 2017-07-25 | Paper |
| Resolute sequences in initial segment complexity | 2017-05-31 | Paper |
| Kobayashi compressibility | 2017-05-12 | Paper |
| Random numbers as probabilities of machine behavior | 2017-05-02 | Paper |
| A Note on the Differences of Computably Enumerable Reals | 2017-04-04 | Paper |
| Limits of the Kucera-Gacs coding method | 2017-03-07 | Paper |
| Computing halting probabilities from other halting probabilities | 2016-12-22 | Paper |
| Unperturbed Schelling segregation in two or three dimensions | 2016-11-29 | Paper |
| Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers | 2016-11-18 | Paper |
| Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega | 2016-08-04 | Paper |
| Kolmogorov complexity and computably enumerable sets | 2015-08-27 | Paper |
| Universality probability of a prefix-free machine | 2015-08-21 | Paper |
| On the existence of a strong minimal pair | 2015-08-14 | Paper |
| Integer valued betting strategies and Turing degrees | 2015-07-13 | Paper |
| Tipping points in 1-dimensional Schelling models with switching agents | 2015-05-08 | Paper |
| EXACT PAIRS FOR THE IDEAL OF THEK-TRIVIAL SEQUENCES IN THE TURING DEGREES | 2014-12-05 | Paper |
| The typical Turing degree | 2014-08-08 | Paper |
| Algorithmic randomness and measures of complexity | 2014-01-17 | Paper |
| Universal computably enumerable sets and initial segment prefix-free complexity | 2014-01-10 | Paper |
| Randomness notions and partial relativization | 2013-11-01 | Paper |
| Measure and cupping in the Turing degrees | 2013-09-03 | Paper |
| K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM | 2013-06-03 | Paper |
| A Cappable Almost Everywhere Dominating Computably Enumerable Degree | 2013-05-10 | Paper |
| On 0′-computable reals | 2013-04-19 | Paper |
| On the gap between trivial and nontrivial initial segment prefix-free complexity | 2013-04-15 | Paper |
| Analogues of Chaitin's Omega in the computably enumerable sets | 2013-03-21 | Paper |
| Compactness arguments with effectively closed sets for the study of relative randomness | 2012-09-05 | Paper |
| Low upper bounds in the Turing degrees revisited | 2012-09-05 | Paper |
| Tracing and domination in the Turing degrees | 2012-03-13 | Paper |
| On the number of infinite sequences with trivial initial segment complexity | 2012-01-04 | Paper |
| Chaitin's halting probability and the compression of strings using oracles | 2011-10-11 | Paper |
| Kolmogorov complexity of initial segments of sequences and arithmetical definability | 2011-10-10 | Paper |
| Upper bounds on ideals in the computably enumerable Turing degrees | 2011-09-22 | Paper |
| Elementary differences between the degrees of unsolvability and degrees of compressibility | 2011-08-26 | Paper |
| Jump inversions inside effectively closed sets and applications to randomness | 2011-06-28 | Paper |
| Relative randomness and cardinality | 2010-07-20 | Paper |
| The importance of Π10 classes in effective randomness | 2010-03-15 | Paper |
| Working with strong reducibilities above totally $\omega $-c.e. and array computable degrees | 2010-03-08 | Paper |
| 𝐾-trivial degrees and the jump-traceability hierarchy | 2009-05-27 | Paper |
| Non-cupping, measure and computably enumerable splittings | 2009-03-24 | Paper |
| K-Triviality of Closed Sets and Continuous Functions | 2009-03-02 | Paper |
| \(\Pi_1^0 \) classes, LR degrees and Turing degrees | 2008-12-05 | Paper |
| Randomness, lowness and degrees | 2008-06-09 | Paper |
| Algorithmic randomness of continuous functions | 2008-05-26 | Paper |
| Post's Programme for the Ershov Hierarchy | 2008-02-07 | Paper |
| Algorithmic Randomness of Closed Sets | 2008-02-07 | Paper |
| Working with the LR Degrees | 2007-11-13 | Paper |
| K-Trivial Closed Sets and Continuous Functions | 2007-11-13 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees | 2007-02-20 | Paper |
| A c.e. real that cannot be sw-computed by any \(\Omega\) number | 2007-02-15 | Paper |
| Randomness and the linear degrees of computability | 2007-02-14 | Paper |
| Random reals and Lipschitz continuity | 2007-02-09 | Paper |
| Random non-cupping revisited | 2007-02-08 | Paper |
| The ibT degrees of computably enumerable sets are not dense | 2006-08-16 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| Hypersimplicity and semicomputability in the weak truth table degrees | 2005-12-14 | Paper |
| h-monotonically computable real numbers | 2005-04-07 | Paper |
| Approximation representations for reals and their wtt‐degrees | 2005-02-16 | Paper |
| Approximation representations for \(\Delta_2\) reals | 2005-02-11 | Paper |
| The approximation structure of a computably approximable real | 2005-02-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452110 | 2004-02-11 | Paper |
| A transfinite hierarchy of reals | 2003-04-10 | Paper |
| Pathwise-random trees and models of second-order arithmetic | N/A | Paper |
