| Publication | Date of Publication | Type |
|---|
The complexity of completions in partial combinatory algebra
Mathematical Structures in Computer Science | 2024-11-09 | Paper |
scientific article; zbMATH DE number 7828641 (Why is no real title available?)
| 2024-04-08 | Paper |
The complexity of completions in partial combinatory algebra
| 2023-07-24 | Paper |
Embeddings between partial combinatory algebras
Notre Dame Journal of Formal Logic | 2023-05-31 | Paper |
The complexity of universal text-learners
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Genericity and measure for exponential time (extended abstract)
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
Partial combinatory algebra and generalized numberings
Theoretical Computer Science | 2022-06-24 | Paper |
Fixpoints and relative precompleteness
Computability | 2022-05-16 | Paper |
Ordinal analysis of partial combinatory algebras
Journal of Symbolic Logic | 2021-12-09 | Paper |
Normalized information distance and the oscillation hierarchy
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Computability in partial combinatory algebras
The Bulletin of Symbolic Logic | 2021-04-21 | Paper |
Ordinal analysis of partial combinatory algebras
| 2020-10-23 | Paper |
The noneffectivity of Arslanov's completeness criterion and related theorems
Archive for Mathematical Logic | 2020-07-17 | Paper |
Partial combinatory algebra and generalized numberings
| 2019-10-17 | Paper |
Fixed point theorems for precomplete numberings
Annals of Pure and Applied Logic | 2019-07-10 | Paper |
GENERALIZATIONS OF THE RECURSION THEOREM
Journal of Symbolic Logic | 2019-01-04 | Paper |
The arithmetical complexity of dimension and randomness
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Covering the recursive sets
Annals of Pure and Applied Logic | 2017-02-08 | Paper |
Covering the Recursive Sets
Evolving Computability | 2015-10-20 | Paper |
Generalizations of the weak law of the excluded middle
Notre Dame Journal of Formal Logic | 2015-07-20 | Paper |
Effective genericity and differentiability
Journal of Logic and Analysis | 2014-11-20 | Paper |
Model theory of measure spaces and probability logic
The Review of Symbolic Logic | 2014-03-06 | Paper |
Intuitionistic logic and Muchnik degrees
Algebra Universalis | 2012-05-03 | Paper |
The finite intervals of the Muchnik lattice
Transactions of the American Mathematical Society | 2012-04-27 | Paper |
Nonapproximability of the normalized information distance
Journal of Computer and System Sciences | 2011-04-28 | Paper |
Notes on sum-tests and independence tests
Theory of Computing Systems | 2011-03-30 | Paper |
Intuitionistic Logic and Computability Theory
Logic, Language, Information and Computation | 2010-09-29 | Paper |
Decidability and Undecidability in Probability Logic
Logical Foundations of Computer Science | 2009-02-24 | Paper |
Intermediate logics and factors of the Medvedev lattice
Annals of Pure and Applied Logic | 2008-11-12 | Paper |
Limit computability and constructive measure
| 2008-10-20 | Paper |
On the structure of the Medvedev lattice
Journal of Symbolic Logic | 2008-06-09 | Paper |
Kripke models, distributive lattices, and Medvedev degrees
Studia Logica | 2007-09-10 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Complexity and randomness
| 2007-02-02 | Paper |
Calibrating Randomness
The Bulletin of Symbolic Logic | 2006-12-06 | Paper |
Learning and computing in the limit
| 2006-10-17 | Paper |
Constructive logic and the Medvedev lattice
Notre Dame Journal of Formal Logic | 2006-10-04 | Paper |
The Medvedev lattice of computably closed sets
Archive for Mathematical Logic | 2006-03-21 | Paper |
Randomness, relativization and Turing degrees
Journal of Symbolic Logic | 2006-01-16 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
On partial randomness
Annals of Pure and Applied Logic | 2005-12-29 | Paper |
Probabilistic Logic and Induction
Journal Of Logic And Computation | 2005-10-18 | Paper |
Counting extensional differences in BC-learning
Information and Computation | 2004-11-23 | Paper |
Almost complete sets.
Theoretical Computer Science | 2004-03-14 | Paper |
scientific article; zbMATH DE number 2019610 (Why is no real title available?)
| 2003-12-17 | Paper |
scientific article; zbMATH DE number 2006627 (Why is no real title available?)
| 2003-11-23 | Paper |
Computably Enumerable Reals and Uniformly Presentable Ideals
| 2003-04-03 | Paper |
The complexity of universal text-learners.
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1795232 (Why is no real title available?)
| 2002-09-03 | Paper |
Computational randomness and lowness
The Journal of Symbolic Logic | 2002-07-25 | Paper |
scientific article; zbMATH DE number 1670728 (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 |
Lowness for the class of random sets
Journal of Symbolic Logic | 2001-01-28 | Paper |
scientific article; zbMATH DE number 1555954 (Why is no real title available?)
| 2001-01-24 | Paper |
Arithmetical Measure
Mathematical Logic Quarterly | 1998-11-01 | Paper |
Resource bounded randomness and weakly complete problems
Theoretical Computer Science | 1998-07-23 | Paper |
Genericity and measure for exponential time
Theoretical Computer Science | 1997-02-27 | Paper |
Completions of Kleene's second model
| N/A | Paper |
Fixed Point Theorems in Computability Theory
| N/A | Paper |
