Sebastiaan Terwijn

Log. Methods Comput. Sci., 2025

2024

The complexity of completions in partial combinatory algebra.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2024

Computable Structure Theory of Partial Combinatory Algebras.

[BibT_eX]

[DOI]

Ekaterina B. Fokina

Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

Fixed Point Theorems in Computability Theory.

[BibT_eX]

[DOI]

Proceedings of the Logics and Type Systems in Theory and Practice, 2024

2022

Partial combinatory algebra and generalized numberings.

[BibT_eX]

[DOI]

Henk Barendregt

Theor. Comput. Sci., 2022

Normalized information distance and the oscillation hierarchy.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Wolfgang Merkle

J. Comput. Syst. Sci., 2022

Embeddings between partial combinatory algebras.

[BibT_eX]

[DOI]

Anton Golov

CoRR, 2022

Fixpoints and relative precompleteness.

[BibT_eX]

[DOI]

Anton Golov

Comput., 2022

2021

Ordinal Analysis of Partial Combinatory Algebras.

[BibT_eX]

[DOI]

Paul Shafer

J. Symb. Log., 2021

2020

Computability in Partial Combinatory Algebras.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2020

The noneffectivity of Arslanov's completeness criterion and related theorems.

[BibT_eX]

[DOI]

Arch. Math. Log., 2020

2019

Fixed point theorems for precomplete numberings.

[BibT_eX]

[DOI]

Henk Barendregt

Ann. Pure Appl. Log., 2019

2018

Generalizations of the Recursion Theorem.

[BibT_eX]

[DOI]

J. Symb. Log., 2018

2015

Generalizations of the Weak Law of the Excluded Middle.

[BibT_eX]

[DOI]

Andrea Sorbi

Notre Dame J. Formal Log., 2015

Covering the Recursive Sets.

[BibT_eX]

[DOI]

Bjørn Kjos-Hanssen

Proceedings of the Evolving Computability - 11th Conference on Computability in Europe, 2015

2014

Effective genericity and differentiability.

[BibT_eX]

[DOI]

Rutger Kuyper

J. Log. Anal., 2014

2013

Model Theory of Measure Spaces and Probability Logic.

[BibT_eX]

[DOI]

Rutger Kuyper

Rev. Symb. Log., 2013

2011

Notes on Sum-Tests and Independence Tests.

[BibT_eX]

[DOI]

Bruno Bauwens

Theory Comput. Syst., 2011

Nonapproximability of the normalized information distance.

[BibT_eX]

[DOI]

Paul M. B. Vitányi

J. Comput. Syst. Sci., 2011

2010

Normalized Information Distance is Not Semicomputable

[BibT_eX]

[DOI]

Paul M. B. Vitányi

CoRR, 2010

Intuitionistic Logic and Computability Theory.

[BibT_eX]

[DOI]

Proceedings of the Logic, 2010

2009

Nonapproximablity of the Normalized Information Distance

[BibT_eX]

[DOI]

Paul M. B. Vitányi

CoRR, 2009

Decidability and Undecidability in Probability Logic.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008

On the structure of the Medvedev lattice.

[BibT_eX]

[DOI]

J. Symb. Log., 2008

Intermediate logics and factors of the Medvedev lattice.

[BibT_eX]

[DOI]

Andrea Sorbi

Ann. Pure Appl. Log., 2008

2006

Constructive Logic and the Medvedev Lattice.

[BibT_eX]

[DOI]

Notre Dame J. Formal Log., 2006

Calibrating Randomness.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2006

On partial randomness.

[BibT_eX]

[DOI]

Cristian S. Calude

Ludwig Staiger

Ann. Pure Appl. Log., 2006

The Medvedev lattice of computably closed sets.

[BibT_eX]

[DOI]

Arch. Math. Log., 2006

2005

Probabilistic Logic and Induction.

[BibT_eX]

[DOI]

J. Log. Comput., 2005

Randomness, relativization and Turing degrees.

[BibT_eX]

[DOI]

André Nies

J. Symb. Log., 2005

Kripke Models, Distributive Lattices, and Medvedev Degrees.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

Counting extensional differences in BC-learning.

[BibT_eX]

[DOI]

Sanjay Jain

Inf. Comput., 2004

2003

The Arithmetical Complexity of Dimension and Randomness.

[BibT_eX]

[DOI]

John M. Hitchcock

Jack H. Lutz

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

2002

Computably Enumerable Reals and Uniformly Presentable Ideals.

[BibT_eX]

[DOI]

Rodney G. Downey

Math. Log. Q., 2002

On the Learnability of Hidden Markov Models.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001

Computational Randomness and Lowness.

[BibT_eX]

[DOI]

Domenico Zambella

J. Symb. Log., 2001

Linear Ramified Higher Type Recursion and Parallel Complexity.

[BibT_eX]

[DOI]

Klaus Aehlig

Jan Johannsen

Helmut Schwichtenberg

Proceedings of the Proof Theory in Computer Science, International Seminar, 2001

2000

Almost Complete Sets.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

Counting Extensional Differences in BC-Learning.

[BibT_eX]

[DOI]

Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1999

Lowness for The Class of Random Sets.

[BibT_eX]

[DOI]

Antonín Kucera

J. Symb. Log., 1999

Extensional Set Learning (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Twelfth Annual Conference on Computational Learning Theory, 1999

1998

Arithmetical Measure.

[BibT_eX]

[DOI]

Math. Log. Q., 1998

1997

The Complexity of Universal Text-Learners.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1994

Genericity and Measure for Exponential Time.

[BibT_eX]

[DOI]

Klaus Ambos-Spies

Hans-Christian Neis

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Resource Bounded Randomness and Weakly Complete Problems.

[BibT_eX]

[DOI]

Klaus Ambos-Spies