| Publication | Date of Publication | Type |
|---|
Complexity of inversion of functions on the reals
Mathematical Structures in Computer Science | 2025-11-25 | Paper |
Computable one-way functions on the reals
Information and Computation | 2025-09-09 | Paper |
Pathwise-randomness and models of second-order arithmetic
Information and Computation | 2024-06-21 | Paper |
Growth and irreducibility in path-incompressible trees
Information and Computation | 2024-03-27 | Paper |
| Compression of enumerations and gain | 2023-04-06 | Paper |
The Kučera-Gács theorem revisited by Levin
Theoretical Computer Science | 2023-02-01 | Paper |
Randomness below complete theories of arithmetic
Information and Computation | 2023-01-12 | Paper |
Randomness below complete theories of arithmetic
(available as arXiv preprint) | 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
(available as arXiv preprint) | 2021-10-31 | Paper |
The idemetric property: when most distances are (almost) the same
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-10-29 | Paper |
Limits of the Kučera–Gács Coding Method
Structure and Randomness in Computability and Set Theory | 2021-06-15 | Paper |
Granularity of wagers in games and the possibility of saving
Information and Computation | 2020-12-15 | Paper |
Monotonous betting strategies in warped casinos
Information and Computation | 2020-03-12 | Paper |
Compression of Data Streams Down to Their Information Content
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Minority population in the one-dimensional Schelling model of segregation
Journal of Statistical Physics | 2018-12-21 | Paper |
Equivalences between learning of data and probability distributions, and their applications
Information and Computation | 2018-09-27 | Paper |
Pointed computations and Martin-Löf randomness
Computability | 2018-09-20 | Paper |
Digital morphogenesis via schelling segregation
Nonlinearity | 2018-05-09 | Paper |
Digital morphogenesis via schelling segregation
Nonlinearity | 2018-05-09 | Paper |
The information content of typical reals
Turing’s Revolution | 2018-04-18 | Paper |
Optimal redundancy in computations from random oracles
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Optimal redundancy in computations from random oracles
Journal of Computer and System Sciences | 2017-11-14 | Paper |
The probability of a computable output from a random oracle
ACM Transactions on Computational Logic | 2017-10-16 | Paper |
Differences of halting probabilities
Journal of Computer and System Sciences | 2017-09-07 | Paper |
Differences of halting probabilities
Journal of Computer and System Sciences | 2017-09-07 | Paper |
| Aspects of Chaitin's Omega | 2017-07-25 | Paper |
Resolute sequences in initial segment complexity
Proceedings of the 12th Asian Logic Conference | 2017-05-31 | Paper |
Kobayashi compressibility
Theoretical Computer Science | 2017-05-12 | Paper |
Random numbers as probabilities of machine behavior
Theoretical Computer Science | 2017-05-02 | Paper |
A Note on the Differences of Computably Enumerable Reals
Computability and Complexity | 2017-04-04 | Paper |
A Note on the Differences of Computably Enumerable Reals
Computability and Complexity | 2017-04-04 | Paper |
Limits of the Kucera-Gacs coding method
(available as arXiv preprint) | 2017-03-07 | Paper |
Computing halting probabilities from other halting probabilities
Theoretical Computer Science | 2016-12-22 | Paper |
Unperturbed Schelling segregation in two or three dimensions
Journal of Statistical Physics | 2016-11-29 | Paper |
Unperturbed Schelling segregation in two or three dimensions
Journal of Statistical Physics | 2016-11-29 | Paper |
Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers
Information and Computation | 2016-11-18 | Paper |
Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega
Journal of Computer and System Sciences | 2016-08-04 | Paper |
Kolmogorov complexity and computably enumerable sets
Annals of Pure and Applied Logic | 2015-08-27 | Paper |
Universality probability of a prefix-free machine
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
On the existence of a strong minimal pair
Journal of Mathematical Logic | 2015-08-14 | Paper |
Integer valued betting strategies and Turing degrees
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Tipping points in 1-dimensional Schelling models with switching agents
Journal of Statistical Physics | 2015-05-08 | Paper |
Exact pairs for the ideal of the \(K\)-trivial sequences in the Turing degrees
Journal of Symbolic Logic | 2014-12-05 | Paper |
The typical Turing degree
Proceedings of the London Mathematical Society. Third Series | 2014-08-08 | Paper |
Algorithmic randomness and measures of complexity
The Bulletin of Symbolic Logic | 2014-01-17 | Paper |
Universal computably enumerable sets and initial segment prefix-free complexity
Information and Computation | 2014-01-10 | Paper |
Randomness notions and partial relativization
Israel Journal of Mathematics | 2013-11-01 | Paper |
Measure and cupping in the Turing degrees
Proceedings of the American Mathematical Society | 2013-09-03 | Paper |
\(K\)-trivials are never continuously random
Proceedings of the 11th Asian Logic Conference | 2013-06-03 | Paper |
A Cappable Almost Everywhere Dominating Computably Enumerable Degree
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
On \(0'\)-computable reals
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
On the gap between trivial and nontrivial initial segment prefix-free complexity
Theory of Computing Systems | 2013-04-15 | Paper |
Analogues of Chaitin's Omega in the computably enumerable sets
Information Processing Letters | 2013-03-21 | Paper |
Compactness arguments with effectively closed sets for the study of relative randomness
Journal of Logic and Computation | 2012-09-05 | Paper |
Low upper bounds in the Turing degrees revisited
Journal of Logic and Computation | 2012-09-05 | Paper |
Tracing and domination in the Turing degrees
Annals of Pure and Applied Logic | 2012-03-13 | Paper |
On the number of infinite sequences with trivial initial segment complexity
Theoretical Computer Science | 2012-01-04 | Paper |
Chaitin's halting probability and the compression of strings using oracles
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2011-10-11 | Paper |
Kolmogorov complexity of initial segments of sequences and arithmetical definability
Theoretical Computer Science | 2011-10-10 | Paper |
Upper bounds on ideals in the computably enumerable Turing degrees
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
Elementary differences between the degrees of unsolvability and degrees of compressibility
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Jump inversions inside effectively closed sets and applications to randomness
Journal of Symbolic Logic | 2011-06-28 | Paper |
Relative randomness and cardinality
Notre Dame Journal of Formal Logic | 2010-07-20 | Paper |
The importance of \(\Pi^0_1\) classes in effective randomness
Journal of Symbolic Logic | 2010-03-15 | Paper |
Working with strong reducibilities above totally \(\omega \)-c.e. and array computable degrees
Transactions of the American Mathematical Society | 2010-03-08 | Paper |
𝐾-trivial degrees and the jump-traceability hierarchy
Proceedings of the American Mathematical Society | 2009-05-27 | Paper |
Non-cupping, measure and computably enumerable splittings
Mathematical Structures in Computer Science | 2009-03-24 | Paper |
K-Triviality of Closed Sets and Continuous Functions
Journal Of Logic And Computation | 2009-03-02 | Paper |
\(\Pi_1^0 \) classes, LR degrees and Turing degrees
Annals of Pure and Applied Logic | 2008-12-05 | Paper |
Randomness, lowness and degrees
Journal of Symbolic Logic | 2008-06-09 | Paper |
Algorithmic randomness of continuous functions
Archive for Mathematical Logic | 2008-05-26 | Paper |
Algorithmic Randomness of Closed Sets
Journal Of Logic And Computation | 2008-02-07 | Paper |
Post's Programme for the Ershov Hierarchy
Journal Of Logic And Computation | 2008-02-07 | Paper |
Working with the LR Degrees
Lecture Notes in Computer Science | 2007-11-13 | Paper |
K-Trivial Closed Sets and Continuous Functions
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees
Notre Dame Journal of Formal Logic | 2007-02-20 | Paper |
A c.e. real that cannot be sw-computed by any \(\Omega\) number
Notre Dame Journal of Formal Logic | 2007-02-15 | Paper |
Randomness and the linear degrees of computability
Annals of Pure and Applied Logic | 2007-02-14 | Paper |
Random reals and Lipschitz continuity
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
Random non-cupping revisited
Journal of Complexity | 2007-02-08 | Paper |
The ibT degrees of computably enumerable sets are not dense
Annals of Pure and Applied Logic | 2006-08-16 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Hypersimplicity and semicomputability in the weak truth table degrees
Archive for Mathematical Logic | 2005-12-14 | Paper |
h-monotonically computable real numbers
MLQ | 2005-04-07 | Paper |
Approximation representations for reals and their wtt‐degrees
Mathematical Logic Quarterly | 2005-02-16 | Paper |
Approximation representations for \(\Delta_2\) reals
Archive for Mathematical Logic | 2005-02-11 | Paper |
The approximation structure of a computably approximable real
Journal of Symbolic Logic | 2005-02-09 | Paper |
| scientific article; zbMATH DE number 2040958 (Why is no real title available?) | 2004-02-11 | Paper |
A transfinite hierarchy of reals
Mathematical Logic Quarterly | 2003-04-10 | Paper |
Pathwise-random trees and models of second-order arithmetic
(available as arXiv preprint) | N/A | Paper |
