Sebastiaan Terwijn

According to our database, Sebastiaan Terwijn authored at least 45 papers between 1996 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Fixed Point Theorems in Computability Theory.

Sebastiaan A. Terwijn

CoRR, 2024

2023

Completions of Kleene's second model.

Sebastiaan A. Terwijn

CoRR, 2023

The complexity of completions in partial combinatory algebra.

Sebastiaan A. Terwijn

CoRR, 2023

2022

Partial combinatory algebra and generalized numberings.

Henk Barendregt, Sebastiaan A. Terwijn

Theor. Comput. Sci., 2022

Normalized information distance and the oscillation hierarchy.

Klaus Ambos-Spies, Wolfgang Merkle, Sebastiaan A. Terwijn

J. Comput. Syst. Sci., 2022

Embeddings between partial combinatory algebras.

Anton Golov, Sebastiaan A. Terwijn

CoRR, 2022

Fixpoints and relative precompleteness.

Anton Golov, Sebastiaan A. Terwijn

Comput., 2022

2021

Ordinal Analysis of Partial Combinatory Algebras.

Paul Shafer, Sebastiaan A. Terwijn

J. Symb. Log., 2021

2020

Computability in Partial Combinatory Algebras.

Sebastiaan A. Terwijn

Bull. Symb. Log., 2020

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

Sebastiaan A. Terwijn

Arch. Math. Log., 2020

2019

Fixed point theorems for precomplete numberings.

Henk Barendregt, Sebastiaan A. Terwijn

Ann. Pure Appl. Log., 2019

2018

Generalizations of the Recursion Theorem.

Sebastiaan A. Terwijn

J. Symb. Log., 2018

2017

Covering the recursive sets.

Bjørn Kjos-Hanssen, Frank Stephan, Sebastiaan A. Terwijn

Ann. Pure Appl. Log., 2017

2015

Generalizations of the Weak Law of the Excluded Middle.

Andrea Sorbi, Sebastiaan A. Terwijn

Notre Dame J. Formal Log., 2015

2014

Effective genericity and differentiability.

Rutger Kuyper, Sebastiaan Terwijn

J. Log. Anal., 2014

2013

Model Theory of Measure Spaces and Probability Logic.

Rutger Kuyper, Sebastiaan A. Terwijn

Rev. Symb. Log., 2013

2011

Notes on Sum-Tests and Independence Tests.

Bruno Bauwens, Sebastiaan A. Terwijn

Theory Comput. Syst., 2011

Nonapproximability of the normalized information distance.

Sebastiaan A. Terwijn, Leen Torenvliet, Paul M. B. Vitányi

J. Comput. Syst. Sci., 2011

2010

Normalized Information Distance is Not Semicomputable

Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi

CoRR, 2010

Intuitionistic Logic and Computability Theory.

Sebastiaan Terwijn

Proceedings of the Logic, 2010

2009

Nonapproximablity of the Normalized Information Distance

Sebastiaan Terwijn, Leen Torenvliet, Paul M. B. Vitányi

CoRR, 2009

Decidability and Undecidability in Probability Logic.

Sebastiaan Terwijn

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

2008

On the structure of the Medvedev lattice.

Sebastiaan Terwijn

J. Symb. Log., 2008

Intermediate logics and factors of the Medvedev lattice.

Andrea Sorbi, Sebastiaan Terwijn

Ann. Pure Appl. Log., 2008

2007

The arithmetical complexity of dimension and randomness.

John M. Hitchcock, Jack H. Lutz, Sebastiaan Terwijn

ACM Trans. Comput. Log., 2007

Kripke Models, Distributive Lattices, and Medvedev Degrees.

Sebastiaan Terwijn

Stud Logica, 2007

2006

Constructive Logic and the Medvedev Lattice.

Sebastiaan A. Terwijn

Notre Dame J. Formal Log., 2006

Calibrating Randomness.

Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn

Bull. Symb. Log., 2006

On partial randomness.

Cristian S. Calude, Ludwig Staiger, Sebastiaan Terwijn

Ann. Pure Appl. Log., 2006

The Medvedev lattice of computably closed sets.

Sebastiaan Terwijn

Arch. Math. Log., 2006

2005

Probabilistic Logic and Induction.

Sebastiaan Terwijn

J. Log. Comput., 2005

Randomness, relativization and Turing degrees.

André Nies, Frank Stephan, Sebastiaan Terwijn

J. Symb. Log., 2005

2004

Counting extensional differences in BC-learning.

Sanjay Jain, Frank Stephan, Sebastiaan Terwijn

Inf. Comput., 2004

2003

Almost complete sets.

Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan Terwijn

Theor. Comput. Sci., 2003

2002

Computably Enumerable Reals and Uniformly Presentable Ideals.

Rodney G. Downey, Sebastiaan Terwijn

Math. Log. Q., 2002

On the Learnability of Hidden Markov Models.

Sebastiaan Terwijn

Proceedings of the Grammatical Inference: Algorithms and Applications, 2002

2001

Computational Randomness and Lowness.

Sebastiaan Terwijn, Domenico Zambella

J. Symb. Log., 2001

Linear Ramified Higher Type Recursion and Parallel Complexity.

Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn

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

2000

Counting Extensional Differences in BC-Learning.

Frank Stephan, Sebastiaan Terwijn

Proceedings of the Grammatical Inference: Algorithms and Applications, 2000

1999

Lowness for The Class of Random Sets.

Antonín Kucera, Sebastiaan Terwijn

J. Symb. Log., 1999

The Complexity of Universal Text-Learners.

Frank Stephan, Sebastiaan Terwijn

Inf. Comput., 1999

Extensional Set Learning (extended abstract).

Sebastiaan Terwijn

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

1998

Arithmetical Measure.

Sebastiaan Terwijn, Leen Torenvliet

Math. Log. Q., 1998

1997

Resource Bounded Randomness and Weakly Complete Problems.

Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng

Theor. Comput. Sci., 1997

1996

Genericity and Measure for Exponential Time.

Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn

Theor. Comput. Sci., 1996