| 2009 |
|---|
| 28 | EE | Sebastiaan Terwijn:
Decidability and Undecidability in Probability Logic.
LFCS 2009: 441-450 |
| 2008 |
|---|
| 27 | EE | Andrea Sorbi,
Sebastiaan Terwijn:
Intermediate logics and factors of the Medvedev lattice.
Ann. Pure Appl. Logic 155(2): 69-85 (2008) |
| 2007 |
|---|
| 26 | EE | John M. Hitchcock,
Jack H. Lutz,
Sebastiaan Terwijn:
The arithmetical complexity of dimension and randomness.
ACM Trans. Comput. Log. 8(2): (2007) |
| 25 | EE | Sebastiaan Terwijn:
Kripke Models, Distributive Lattices, and Medvedev Degrees.
Studia Logica 85(3): 319-332 (2007) |
| 2006 |
|---|
| 24 | EE | Cristian S. Calude,
Ludwig Staiger,
Sebastiaan Terwijn:
On partial randomness.
Ann. Pure Appl. Logic 138(1-3): 20-30 (2006) |
| 23 | EE | Sebastiaan Terwijn:
The Medvedev lattice of computably closed sets.
Arch. Math. Log. 45(2): 179-190 (2006) |
| 2005 |
|---|
| 22 | EE | Sebastiaan Terwijn:
Kripke Models, Distributive Lattices, and Medvedev Degrees.
CiE 2005: 486-494 |
| 21 | EE | Sebastiaan Terwijn:
Probabilistic Logic and Induction.
J. Log. Comput. 15(4): 507-515 (2005) |
| 2004 |
|---|
| 20 | EE | John M. Hitchcock,
Jack H. Lutz,
Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness
CoRR cs.LO/0408043: (2004) |
| 19 | EE | John M. Hitchcock,
Jack H. Lutz,
Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness
Electronic Colloquium on Computational Complexity (ECCC)(079): (2004) |
| 18 | EE | Sanjay Jain,
Frank Stephan,
Sebastiaan Terwijn:
Counting extensional differences in BC-learning.
Inf. Comput. 188(1): 127-142 (2004) |
| 2003 |
|---|
| 17 | EE | John M. Hitchcock,
Jack H. Lutz,
Sebastiaan Terwijn:
The Arithmetical Complexity of Dimension and Randomness.
CSL 2003: 241-254 |
| 16 | EE | Klaus Ambos-Spies,
Wolfgang Merkle,
Jan Reimann,
Sebastiaan Terwijn:
Almost complete sets.
Theor. Comput. Sci. 306(1-3): 177-194 (2003) |
| 2002 |
|---|
| 15 | EE | Sebastiaan Terwijn:
On the Learnability of Hidden Markov Models.
ICGI 2002: 261-268 |
| 14 | EE | Rodney G. Downey,
Sebastiaan Terwijn:
Computably Enumerable Reals and Uniformly Presentable Ideals.
Math. Log. Q. 48(S1): 29-40 (2002) |
| 2001 |
|---|
| 13 | EE | Klaus Aehlig,
Jan Johannsen,
Helmut Schwichtenberg,
Sebastiaan Terwijn:
Linear Ramified Higher Type Recursion and Parallel Complexity.
Proof Theory in Computer Science 2001: 1-21 |
| 12 | | Sebastiaan Terwijn,
Domenico Zambella:
Computational Randomness and Lowiness.
J. Symb. Log. 66(3): 1199-1205 (2001) |
| 2000 |
|---|
| 11 | | Frank Stephan,
Sebastiaan Terwijn:
Counting Extensional Differences in BC-Learning.
ICGI 2000: 256-269 |
| 10 | EE | Klaus Ambos-Spies,
Wolfgang Merkle,
Jan Reimann,
Sebastiaan Terwijn:
Almost Complete Sets.
STACS 2000: 419-430 |
| 1999 |
|---|
| 9 | EE | Sebastiaan Terwijn:
Extensional Set Learning (extended abstract).
COLT 1999: 243-248 |
| 8 | | Frank Stephan,
Sebastiaan Terwijn:
The Complexity of Universal Text-Learners.
Inf. Comput. 154(2): 149-166 (1999) |
| 7 | | Antonín Kucera,
Sebastiaan Terwijn:
Lowness for The Class of Random Sets.
J. Symb. Log. 64(4): 1396-1402 (1999) |
| 1998 |
|---|
| 6 | | Sebastiaan Terwijn,
Leen Torenvliet:
Arithmetical Measure.
Math. Log. Q. 44: 277-286 (1998) |
| 1997 |
|---|
| 5 | | Frank Stephan,
Sebastiaan Terwijn:
The Complexity of Universal Text-Learners.
FCT 1997: 441-451 |
| 4 | EE | Klaus Ambos-Spies,
Sebastiaan Terwijn,
Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems.
Theor. Comput. Sci. 172(1-2): 195-207 (1997) |
| 1996 |
|---|
| 3 | EE | Klaus Ambos-Spies,
Hans-Christian Neis,
Sebastiaan Terwijn:
Genericity and Measure for Exponential Time.
Theor. Comput. Sci. 168(1): 3-19 (1996) |
| 1994 |
|---|
| 2 | | Klaus Ambos-Spies,
Sebastiaan Terwijn,
Xizhong Zheng:
Resource Bounded Randomness and Weakly Complete Problems.
ISAAC 1994: 369-377 |
| 1 | | Klaus Ambos-Spies,
Hans-Christian Neis,
Sebastiaan Terwijn:
Genericity and Measure for Exponential Time.
MFCS 1994: 221-232 |
