Genericity and Measure for Exponential Time. - Klaus Ambos-Spies; Hans-Christian Neis; Sebastiaan Terwijn (Theor. Comput. Sci., 1996)

Resource Bounded Randomness and Weakly Complete Problems. - Klaus Ambos-Spies; Sebastiaan Terwijn; Xizhong Zheng (Theor. Comput. Sci., 1997)

Arithmetical Measure. - Sebastiaan Terwijn; Leen Torenvliet (Math. Log. Q., 1998)

Extensional Set Learning (extended abstract). - Sebastiaan Terwijn (COLT, 1999)

The Complexity of Universal Text-Learners. - Frank Stephan 001; Sebastiaan Terwijn (Inf. Comput., 1999)

Lowness for The Class of Random Sets. - Antonín Kucera 002; Sebastiaan Terwijn (J. Symb. Log., 1999)

Counting Extensional Differences in BC-Learning. - Frank Stephan 001; Sebastiaan Terwijn (ICGI, 2000)

Linear Ramified Higher Type Recursion and Parallel Complexity. - Klaus Aehlig; Jan Johannsen; Helmut Schwichtenberg; Sebastiaan Terwijn (Proof Theory in Computer Science, 2001)

Computational Randomness and Lowness. - Sebastiaan Terwijn; Domenico Zambella (J. Symb. Log., 2001)

On the Learnability of Hidden Markov Models. - Sebastiaan Terwijn (ICGI, 2002)

Computably Enumerable Reals and Uniformly Presentable Ideals. - Rodney G. Downey; Sebastiaan Terwijn (Math. Log. Q., 2002)

Almost complete sets. - Klaus Ambos-Spies; Wolfgang Merkle; Jan Reimann 001; Sebastiaan Terwijn (Theor. Comput. Sci., 2003)

The Arithmetical Complexity of Dimension and Randomness - John M. Hitchcock; Jack H. Lutz; Sebastiaan Terwijn (Electron. Colloquium Comput. Complex., 2004)

Counting extensional differences in BC-learning. - Sanjay Jain 001; Frank Stephan 001; Sebastiaan Terwijn (Inf. Comput., 2004)

Randomness, relativization and Turing degrees. - André Nies; Frank Stephan 001; Sebastiaan Terwijn (J. Symb. Log., 2005)

Probabilistic Logic and Induction. - Sebastiaan Terwijn (J. Log. Comput., 2005)

The Medvedev lattice of computably closed sets. - Sebastiaan Terwijn (Arch. Math. Log., 2006)

On partial randomness. - Cristian S. Calude; Ludwig Staiger; Sebastiaan Terwijn (Ann. Pure Appl. Log., 2006)

Calibrating Randomness. - Rodney G. Downey; Denis R. Hirschfeldt; André Nies; Sebastiaan Terwijn (Bull. Symb. Log., 2006)

Constructive Logic and the Medvedev Lattice. - Sebastiaan A. Terwijn (Notre Dame J. Formal Log., 2006)

Kripke Models, Distributive Lattices, and Medvedev Degrees. - Sebastiaan Terwijn (Stud Logica, 2007)

Intermediate logics and factors of the Medvedev lattice. - Andrea Sorbi; Sebastiaan Terwijn (Ann. Pure Appl. Log., 2008)

On the structure of the Medvedev lattice. - Sebastiaan Terwijn (J. Symb. Log., 2008)

Decidability and Undecidability in Probability Logic. - Sebastiaan Terwijn (LFCS, 2009)

Nonapproximablity of the Normalized Information Distance - Sebastiaan Terwijn; Leen Torenvliet; Paul M. B. Vitányi (CoRR, 2009)

Intuitionistic Logic and Computability Theory. - Sebastiaan Terwijn (WoLLIC, 2010)

Normalized Information Distance is Not Semicomputable - Sebastiaan Terwijn; Leen Torenvliet; Paul M. B. Vitányi (CoRR, 2010)

Nonapproximability of the normalized information distance. - Sebastiaan A. Terwijn; Leen Torenvliet; Paul M. B. Vitányi (J. Comput. Syst. Sci., 2011)

Notes on Sum-Tests and Independence Tests. - Bruno Bauwens; Sebastiaan A. Terwijn (Theory Comput. Syst., 2011)

Model Theory of Measure Spaces and Probability Logic. - Rutger Kuyper; Sebastiaan A. Terwijn (Rev. Symb. Log., 2013)

Effective genericity and differentiability. - Rutger Kuyper; Sebastiaan Terwijn (J. Log. Anal., 2014)

Generalizations of the Weak Law of the Excluded Middle. - Andrea Sorbi; Sebastiaan A. Terwijn (Notre Dame J. Formal Log., 2015)

Covering the recursive sets. - Bjørn Kjos-Hanssen; Frank Stephan 001; Sebastiaan A. Terwijn (Ann. Pure Appl. Log., 2017)

Generalizations of the Recursion Theorem. - Sebastiaan A. Terwijn (J. Symb. Log., 2018)

Fixed point theorems for precomplete numberings. - Henk Barendregt; Sebastiaan A. Terwijn (Ann. Pure Appl. Log., 2019)

The noneffectivity of Arslanov's completeness criterion and related theorems. - Sebastiaan A. Terwijn (Arch. Math. Log., 2020)

Computability in Partial Combinatory Algebras. - Sebastiaan A. Terwijn (Bull. Symb. Log., 2020)

Ordinal Analysis of Partial Combinatory Algebras. - Paul Shafer; Sebastiaan A. Terwijn (J. Symb. Log., 2021)

Fixpoints and relative precompleteness. - Anton Golov; Sebastiaan A. Terwijn (Comput., 2022)

Embeddings between partial combinatory algebras. - Anton Golov; Sebastiaan A. Terwijn (CoRR, 2022)

Normalized information distance and the oscillation hierarchy. - Klaus Ambos-Spies; Wolfgang Merkle; Sebastiaan A. Terwijn (J. Comput. Syst. Sci., 2022)

Partial combinatory algebra and generalized numberings. - Henk Barendregt; Sebastiaan A. Terwijn (Theor. Comput. Sci., 2022)

Fixed Point Theorems in Computability Theory. - Sebastiaan A. Terwijn (Logics and Type Systems in Theory and Practice, 2024)

Computable Structure Theory of Partial Combinatory Algebras. - Ekaterina B. Fokina; Sebastiaan A. Terwijn (CiE, 2024)

The complexity of completions in partial combinatory algebra. - Sebastiaan Terwijn (Math. Struct. Comput. Sci., 2024)

Completions of Kleene's second model. - Sebastiaan A. Terwijn (Log. Methods Comput. Sci., 2025)