Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 14
Number of items: 14
  • Terwijn, S. A., Torenvliet, L., & Vitányi, P. M. B. (2011). Nonapproximability of the normalized information distance. Journal of Computer and System Sciences, 77(4), 738-742. https://doi.org/10.1016/j.jcss.2010.06.018
  • Open Access
    Bauwens, B., & Terwijn, S. A. (2011). Notes on sum-tests and independence tests. Theory of Computing Systems, 48(2), 247-268. https://doi.org/10.1007/s00224-009-9240-4
  • Terwijn, S. A., Torenvliet, L., & Vitányi, P. M. B. (2009). Nonapproximablity of the normalized information distance. Institute for Logic, Language and Computation. http://arxiv.org/abs/0910.4353
  • Terwijn, S. A. (2009). Decidability and undecidability in probability logic. In S. Artemov, & A. Nerode (Eds.), Logical Foundations of Computer Science: International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009 : proceedings (pp. 441-450). (Lecture Notes in Computer Science; Vol. 5407). Springer. https://doi.org/10.1007/978-3-540-92687-0_30
  • Open Access
    Hirschfeldt, D. R., & Terwijn, S. A. (2008). Limit computability and constructive measure. In C. Chong, Q. Feng, T. A. Slaman, W. H. Woodin, & Y. Yang (Eds.), Computational Prospects of Infinity. - Part II: Presented talks (pp. 131-142). (Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore; Vol. 15). World Scientific. https://doi.org/10.1142/6786
  • Open Access
    Terwijn, S. A. (2008). On the structure of the Medvedev lattice. Journal of Symbolic Logic, 73(2), 543-558. https://doi.org/10.2178/jsl/1208359059
  • Open Access
    Sorbi, A., & Terwijn, S. A. (2008). Intermediate logics and factors of the Medvedev lattice. Annals of Pure and Applied Logic, 155(2), 69-85. https://doi.org/10.1016/j.apal.2008.03.002
  • Terwijn, S. A. (1998). Computability and measure. [Thesis, fully internal, Universiteit van Amsterdam]. Institute for Logic, Language and Computation.
  • Christensen, J. P. R., Kanovei, V. G., Terwijn, S. A., & Zambella, D. (1997). On the complexity of finitely additive measures. (Technical Report; No. 10). Kobenhavns Universitet.
  • Stephan, F. C., & Terwijn, S. A. (1997). The complexity of universal text-learners. In Proceedings of the 11th International Symposium on Fundamentals of Computation Theory (pp. 441-451). (Lecture Notes in Computer Science; No. 1279). Springer-Verlag.
Page 1 of 2