Randomness, relativization and Turing degrees A Nies, F Stephan, SA Terwijn The Journal of Symbolic Logic 70 (2), 515-535, 2005 | 174 | 2005 |
Computational randomness and lowness SA Terwijn, D Zambella The Journal of Symbolic Logic 66 (3), 1199-1205, 2001 | 140* | 2001 |
Calibrating randomness R Downey, DR Hirschfeldt, A Nies, SA Terwijn Bulletin of Symbolic Logic 12 (3), 411-491, 2006 | 133 | 2006 |
Lowness for the class of random sets A Kučera, SA Terwijn The Journal of Symbolic Logic 64 (4), 1396-1402, 1999 | 85 | 1999 |
Resource bounded randomness and weakly complete problems K Ambos-Spies, SA Terwijn, Z Xizhong Theoretical Computer Science 172 (1-2), 195-207, 1997 | 82 | 1997 |
On partial randomness CS Calude, L Staiger, SA Terwijn Annals of Pure and Applied Logic 138 (1-3), 20-30, 2006 | 77 | 2006 |
Genericity and measure for exponential time K Ambos-Spies, HC Neis, SA Terwijn Theoretical Computer Science 168 (1), 3-19, 1996 | 65 | 1996 |
Computability and measure SA Terwijn University of Amsterdam, 1998 | 46 | 1998 |
Nonapproximability of the normalized information distance SA Terwijn, L Torenvliet, PMB Vitányi Journal of Computer and System Sciences 77 (4), 738-742, 2011 | 41 | 2011 |
On the learnability of hidden Markov models SA Terwijn International Colloquium on Grammatical Inference, 261-268, 2002 | 39 | 2002 |
Resource bounded randomness and weakly complete problems K Ambos-Spies, SA Terwijn, Z Xizhong Algorithms and Computation: 5th International Symposium, ISAAC'94 Beijing …, 1994 | 33 | 1994 |
Complexity and randomness SA Terwijn Department of Computer Science, The University of Auckland, New Zealand, 2003 | 28 | 2003 |
Genericity and measure for exponential time K Ambos-Spies, HC Neis, SA Terwijn Mathematical Foundations of Computer Science 1994: 19th International …, 1994 | 28 | 1994 |
The mathematical foundations of randomness SA Terwijn The Challenge of Chance: A Multidisciplinary Approach from Science and the …, 2016 | 24 | 2016 |
The Medvedev lattice of computably closed sets SA Terwijn Archive for Mathematical Logic 45, 179-190, 2006 | 24 | 2006 |
Intermediate logics and factors of the Medvedev lattice A Sorbi, SA Terwijn arXiv preprint math/0606494, 2006 | 23 | 2006 |
The arithmetical complexity of dimension and randomness JM Hitchcock, JH Lutz, SA Terwijn ACM Transactions on Computational Logic (TOCL) 8 (2), 13-es, 2007 | 19 | 2007 |
Fixed point theorems for precomplete numberings H Barendregt, SA Terwijn Annals of Pure and Applied Logic 170 (10), 1151-1161, 2019 | 14 | 2019 |
Computably enumerable reals and uniformly presentable ideals R Downey, SA Terwijn Mathematical Logic Quarterly: Mathematical Logic Quarterly 48 (S1), 29-40, 2002 | 13* | 2002 |
Constructive logic and the Medvedev lattice SA Terwijn Notre Dame Journal of Formal Logic 47 (1), 73-82, 2006 | 12 | 2006 |