| Publication | Date of Publication | Type |
|---|
Martingales in the Study of Randomness
The Splendors and Miseries of Martingales | 2023-09-11 | Paper |
Andrei Kolmogorov and Leonid Levin on Randomness
The Splendors and Miseries of Martingales | 2023-09-11 | Paper |
Relativized depth
Theoretical Computer Science | 2023-02-24 | Paper |
SOME QUESTIONS OF UNIFORMITY IN ALGORITHMIC RANDOMNESS
Journal of Symbolic Logic | 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
Israel Journal of Mathematics | 2021-04-29 | Paper |
On low for speed oracles
| 2020-08-05 | Paper |
Optimal bounds for single-source Kolmogorov extractors
Transactions of the American Mathematical Society | 2020-02-26 | Paper |
On low for speed oracles
Journal of Computer and System Sciences | 2019-11-29 | Paper |
On the interplay between effective notions of randomness and genericity
Journal of Symbolic Logic | 2019-03-15 | Paper |
On the logical strengths of partial solutions to mathematical problems
Transactions of the London Mathematical Society | 2018-05-25 | Paper |
Algorithmic identification of probabilities is hard
Journal of Computer and System Sciences | 2018-05-08 | Paper |
Layerwise computability and image randomness
Theory of Computing Systems | 2018-02-01 | Paper |
Randomness and semimeasures
Notre Dame Journal of Formal Logic | 2017-08-17 | Paper |
Continuous higher randomness
Journal of Mathematical Logic | 2017-06-20 | Paper |
Deep \(\Pi_1^0\) classes
The Bulletin of Symbolic Logic | 2017-05-26 | Paper |
Von Neumann's biased coin revisited
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Parallel and Serial Jumps of Weak Weak König’s Lemma
Computability and Complexity | 2017-04-04 | Paper |
Diagonally non-computable functions and fireworks
Information and Computation | 2017-03-16 | Paper |
Coherent randomness tests and computing the \(K\)-trivial sets
Journal of the European Mathematical Society (JEMS) | 2016-05-02 | Paper |
Generic algorithms for halting problem and optimal machines revisited
Logical Methods in Computer Science | 2016-04-19 | Paper |
What percentage of programs halt?
Automata, Languages, and Programming | 2015-10-27 | Paper |
\(K\)-trivial, \(K\)-low and MLR-low sequences: a tutorial
Fields of Logic and Computation II | 2015-09-22 | Paper |
Solovay functions and their applications in algorithmic randomness
Journal of Computer and System Sciences | 2015-08-31 | Paper |
On zeros of Martin-Löf random Brownian motion
Journal of Logic and Analysis | 2015-01-22 | Paper |
Algorithmic identification of probabilities is hard
Lecture Notes in Computer Science | 2015-01-14 | Paper |
Computuing \(K\)-trivial sets by incomplete random sets
The Bulletin of Symbolic Logic | 2014-10-21 | Paper |
Characterizing lowness for Demuth randomness
The Journal of Symbolic Logic | 2014-09-30 | Paper |
Denjoy, Demuth and density
Journal of Mathematical Logic | 2014-09-05 | Paper |
Algorithmic tests and randomness with respect to a class of measures
Proceedings of the Steklov Institute of Mathematics | 2014-08-04 | Paper |
The axiomatic power of Kolmogorov complexity
Annals of Pure and Applied Logic | 2014-06-06 | Paper |
From bi-immunity to absolute undecidability
Journal of Symbolic Logic | 2014-04-04 | Paper |
Joining non-low C.E. sets with diagonally non-computable functions
Journal Of Logic And Computation | 2014-04-01 | Paper |
Effective randomness for computable probability measures
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
Limit complexities revisited
| 2013-03-19 | Paper |
How powerful are integer-valued martingales?
Theory of Computing Systems | 2012-12-07 | Paper |
Strong reductions in effective randomness
Theoretical Computer Science | 2012-11-08 | Paper |
Separations of non-monotonic randomness notions
| 2012-09-28 | Paper |
Separations of non-monotonic randomness notions
Journal of Logic and Computation | 2012-09-05 | Paper |
The Denjoy alternative for computable functions
| 2012-08-23 | Paper |
Random semicomputable reals revisited
Computation, Physics and Beyond | 2012-06-15 | Paper |
A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points
Information and Computation | 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
Annals of Pure and Applied Logic | 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 |
scientific article; zbMATH DE number 5986691 (Why is no real title available?)
| 2011-12-07 | Paper |
Effective randomness, strong reductions and Demuth's theorem
| 2011-10-09 | Paper |
Limit complexities revisited
Theory of Computing Systems | 2010-10-06 | Paper |
Ergodic-Type Characterizations of Algorithmic Randomness
Programs, Proofs, Processes | 2010-07-29 | Paper |
How powerful are integer-valued martingales?
Lecture Notes in Computer Science | 2010-07-29 | Paper |
Kolmogorov-Loveland stochasticity and Kolmogorov complexity
Theory of Computing Systems | 2010-05-05 | Paper |
Constructive equivalence relations on computable probability measures
Annals of Pure and Applied Logic | 2009-10-26 | Paper |
Constructive dimension and Turing degrees
Theory of Computing Systems | 2009-10-19 | Paper |
scientific article; zbMATH DE number 5606368 (Why is no real title available?)
| 2009-09-22 | Paper |
A simple proof of Miller-Yu theorem
| 2008-06-11 | Paper |
Reconciling Data Compression and Kolmogorov Complexity
Automata, Languages and Programming | 2007-11-28 | Paper |
The Dynamics of Cellular Automata in Shift-Invariant Topologies
Developments in Language Theory | 2007-11-28 | Paper |
Constructive Dimension and Weak Truth-Table Degrees
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
STACS 2007 | 2007-09-03 | Paper |
Constructive Equivalence Relations on Computable Probability Measures
Computer Science – Theory and Applications | 2007-05-02 | Paper |
Bridging Computational Notions of Depth
| N/A | Paper |
