| Publication | Date of Publication | Type |
|---|
Relativized depth
Theoretical Computer Science | 2023-02-24 | Paper |
Speedable Left-c.e. Numbers
Computer Science – Theory and Applications | 2022-10-19 | Paper |
Relativized depth
(available as arXiv preprint) | 2021-12-08 | Paper |
Normalized information distance and the oscillation hierarchy
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Chaitin's \(\Omega\) as a continuous function
Journal of Symbolic Logic | 2020-04-17 | Paper |
Being low along a sequence and elsewhere
Journal of Symbolic Logic | 2020-04-06 | Paper |
Searching for shortest and least programs
Theoretical Computer Science | 2020-01-22 | Paper |
Proving the PCP-Theorem
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | Paper |
Solovay functions and their applications in algorithmic randomness
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Selection by recursively enumerable sets
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Effective randomness for computable probability measures
Electronic Notes in Theoretical Computer Science | 2013-05-10 | Paper |
Maximal pairs of computably enumerable sets in the computably Lipschitz degrees
Theory of Computing Systems | 2013-04-15 | Paper |
Time-bounded Kolmogorov complexity and Solovay functions
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 |
Constant compression and random weights
Computability | 2013-01-30 | 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 |
| Constant compression and random weights | 2012-08-23 | Paper |
| Solovay functions and \(K\)-triviality | 2012-01-23 | Paper |
Kolmogorov complexity and the recursion theorem
Transactions of the American Mathematical Society | 2011-10-17 | Paper |
Traceable Sets
IFIP Advances in Information and Communication Technology | 2010-10-27 | Paper |
Separations by random oracles and ``almost classes for generalized reducibilities
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Generality's price. Inescapable deficiencies in machine-learned programs
Lecture Notes in Computer Science | 2010-03-23 | Paper |
Constructive equivalence relations on computable probability measures
Annals of Pure and Applied Logic | 2009-10-26 | Paper |
Time-Bounded Kolmogorov Complexity and Solovay Functions
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
| A simple proof of Miller-Yu theorem | 2008-06-11 | Paper |
Generation Complexity Versus Distinction Complexity
Lecture Notes in Computer Science | 2008-05-27 | Paper |
When unlearning helps
Information and Computation | 2008-05-19 | Paper |
Kolmogorov complexity and the recursion theorem
Lecture Notes in Computer Science | 2008-03-19 | Paper |
The complexity of stochastic sequences
Journal of Computer and System Sciences | 2008-03-11 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Reconciling Data Compression and Kolmogorov Complexity
Automata, Languages and Programming | 2007-11-28 | Paper |
Schnorr dimension
Mathematical Structures in Computer Science | 2007-02-09 | Paper |
Selection functions that do not preserve normality
Theory of Computing Systems | 2006-10-16 | Paper |
Some results on effective randomness
Theory of Computing Systems | 2006-10-16 | Paper |
Generality's price: Inescapable deficiencies in machine-learned programs
Annals of Pure and Applied Logic | 2006-04-28 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Kolmogorov-Loveland randomness and stochasticity
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
On the construction of effectively random sets
Journal of Symbolic Logic | 2005-08-29 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
Journal of Symbolic Logic | 2005-02-09 | Paper |
Trees and learning
Journal of Computer and System Sciences | 2004-09-08 | Paper |
| scientific article; zbMATH DE number 2086638 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080665 (Why is no real title available?) | 2004-08-04 | Paper |
Almost complete sets.
Theoretical Computer Science | 2004-03-14 | Paper |
On the Autoreducibility of Random Sequences
SIAM Journal on Computing | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 1929969 (Why is no real title available?) | 2003-06-18 | Paper |
| scientific article; zbMATH DE number 1929940 (Why is no real title available?) | 2003-06-18 | Paper |
Refuting learning revisited.
Theoretical Computer Science | 2003-05-22 | Paper |
Separations by random oracles and ``almost classes for generalized reducibilities
Mathematical Logic Quarterly (MLQ) | 2002-11-28 | Paper |
Lattice embeddings for abstract bounded reducibilities
SIAM Journal on Computing | 2002-04-23 | Paper |
The global power of additional queries to \(p\)-random oracles
SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1670881 (Why is no real title available?) | 2001-12-06 | Paper |
| scientific article; zbMATH DE number 1670875 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1500533 (Why is no real title available?) | 2001-03-13 | Paper |
Structural properties of bounded relations with an application to NP optimization problems
Theoretical Computer Science | 2000-12-12 | Paper |
Exact Pairs for Abstract Bounded Reducibilities
Mathematical Logic Quarterly | 2000-05-09 | Paper |
| scientific article; zbMATH DE number 1420830 (Why is no real title available?) | 2000-03-22 | Paper |
| scientific article; zbMATH DE number 1115674 (Why is no real title available?) | 1998-02-09 | Paper |
| scientific article; zbMATH DE number 1086677 (Why is no real title available?) | 1997-11-13 | Paper |
Randomness versus superspeedability
(available as arXiv preprint) | N/A | Paper |
