| Publication | Date of Publication | Type |
|---|
| The complexity of completions in partial combinatory algebra | 2024-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6123964 | 2024-04-08 | Paper |
| The complexity of completions in partial combinatory algebra | 2023-07-24 | Paper |
| Embeddings between partial combinatory algebras | 2023-05-31 | Paper |
| The complexity of universal text-learners | 2022-12-09 | Paper |
| Genericity and measure for exponential time | 2022-08-18 | Paper |
| Partial combinatory algebra and generalized numberings | 2022-06-24 | Paper |
| Fixpoints and relative precompleteness | 2022-05-16 | Paper |
| ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS | 2021-12-09 | Paper |
| Normalized information distance and the oscillation hierarchy | 2021-11-25 | Paper |
| COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS | 2021-04-21 | Paper |
| Ordinal analysis of partial combinatory algebras | 2020-10-23 | Paper |
| The noneffectivity of Arslanov's completeness criterion and related theorems | 2020-07-17 | Paper |
| Partial combinatory algebra and generalized numberings | 2019-10-17 | Paper |
| Fixed point theorems for precomplete numberings | 2019-07-10 | Paper |
| GENERALIZATIONS OF THE RECURSION THEOREM | 2019-01-04 | Paper |
| The arithmetical complexity of dimension and randomness | 2017-07-12 | Paper |
| Covering the recursive sets | 2017-02-08 | Paper |
| Covering the Recursive Sets | 2015-10-20 | Paper |
| Generalizations of the weak law of the excluded middle | 2015-07-20 | Paper |
| Effective genericity and differentiability | 2014-11-20 | Paper |
| MODEL THEORY OF MEASURE SPACES AND PROBABILITY LOGIC | 2014-03-06 | Paper |
| Intuitionistic logic and Muchnik degrees | 2012-05-03 | Paper |
| The finite intervals of the Muchnik lattice | 2012-04-27 | Paper |
| Nonapproximability of the normalized information distance | 2011-04-28 | Paper |
| Notes on sum-tests and independence tests | 2011-03-30 | Paper |
| Intuitionistic Logic and Computability Theory | 2010-09-29 | Paper |
| Decidability and Undecidability in Probability Logic | 2009-02-24 | Paper |
| Intermediate logics and factors of the Medvedev lattice | 2008-11-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3530395 | 2008-10-20 | Paper |
| On the structure of the Medvedev lattice | 2008-06-09 | Paper |
| Kripke models, distributive lattices, and Medvedev degrees | 2007-09-10 | Paper |
| Computer Science Logic | 2007-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3418262 | 2007-02-02 | Paper |
| Calibrating Randomness | 2006-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5494240 | 2006-10-17 | Paper |
| Constructive logic and the Medvedev lattice | 2006-10-04 | Paper |
| The Medvedev lattice of computably closed sets | 2006-03-21 | Paper |
| Randomness, relativization and Turing degrees | 2006-01-16 | Paper |
| New Computational Paradigms | 2006-01-11 | Paper |
| On partial randomness | 2005-12-29 | Paper |
| Probabilistic Logic and Induction | 2005-10-18 | Paper |
| Counting extensional differences in BC-learning | 2004-11-23 | Paper |
| Almost complete sets. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440404 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4436023 | 2003-11-23 | Paper |
| Computably Enumerable Reals and Uniformly Presentable Ideals | 2003-04-03 | Paper |
| The complexity of universal text-learners. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552753 | 2002-09-03 | Paper |
| Computational randomness and lowness | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754021 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501552 | 2001-03-13 | Paper |
| Lowness for the class of random sets | 2001-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525724 | 2001-01-24 | Paper |
| Arithmetical Measure | 1998-11-01 | Paper |
| Resource bounded randomness and weakly complete problems | 1998-07-23 | Paper |
| Genericity and measure for exponential time | 1997-02-27 | Paper |
| Completions of Kleene's second model | N/A | Paper |
| Fixed Point Theorems in Computability Theory | N/A | Paper |
