The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sebastiaan Terwijn: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  26. Decidability and Undecidability in Probability Logic. [Citation Graph (, )][DBLP]


  27. Intuitionistic Logic and Computability Theory. [Citation Graph (, )][DBLP]


  28. Intermediate logics and factors of the Medvedev lattice. [Citation Graph (, )][DBLP]


  29. Calibrating Randomness. [Citation Graph (, )][DBLP]


  30. Nonapproximablity of the Normalized Information Distance [Citation Graph (, )][DBLP]


  31. Normalized Information Distance is Not Semicomputable [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002