-
Visser, A. (1997) Dynamic Relation Logic Is the Logic of DPL-Relations.Journal of Logic, Language and Information, Vol. 6 (pp 441-452)Article | https://doi.org/10.1023/A:1008228122853 | UvA-DARE
-
Visser, A. (1997) An overview of interpretability logic.Research report Logic Group Preprint Series. Department of Philosophy, University of Utrecht.Report | UvA-DARE
-
Visser, A. (1997) Prolegomena to the definition of dynamic predicate logic with local assignments.Research report Logic Group Preprint Series. Universiteit Utrecht.Report | UvA-DARE
-
Visser, A.P., van Benthem, J.F.A.K., de Jongh, D., Renardel de Lavalette, G.R. (1995) NNIL, a study in intuitionistic propositional logic.In de Rijke, M. Ponse, A. Venema, Y. (Eds.), Modal Logic and process Algebra, a bisimulation perspective (pp 289-326). Center for the Study of Language and Information.Chapter | UvA-DAREVisser, H., van Benthem, J.F.A.K. (2009) Inleiding.In Beth, E.W. (Eds.), Door wetenschap tot wijsheid : verzameling wijsgerige studiën (Amsterdam Academic Archive). Amsterdam University Press.Chapter | UvA-DAREVitányi, P.M.B., Amano, K., Tromp, J.A.H., Watanabe, O. (2001) On a generalized ruin problem.In Proc. RANDOM 2001, Lecture Notes in Computer Science (pp 181-191). Springer Verlag.Conference contribution | UvA-DAREVitányi, P.M.B., Balbach, F.J., Cilibrasi, R.L., Li, M. (2008) Normalized information distance.Institute for Logic, Language and Computation.Working paper | http://arxiv.org/abs/0809.2553 | UvA-DAREVitányi, P.M.B., Balbach, F.J., Cilibrasi, R.L., Li, M. (2009) Normalized information distance.In Emmert-Streib, F. Dehmer, M. (Eds.), Information theory and statistical learning (pp 45-82). Springer.Chapter | https://doi.org/10.1007/978-0-387-84816-7_3 | UvA-DAREVitányi, P.M.B., Buhrman, H., Tromp, J.A.H. (2001) Time and space bounds for reversible simulation.In Proc. ICALP 2001, Lecture Notes in Computer Science (pp 1017-1027). Springer Verlag.Conference contribution | UvA-DAREVitányi, P.M.B., Chater, N. (2013) Algorithmic Identification of Probabilities.ArXiv.Preprint | https://doi.org/10.48550/arXiv.1311.7385 | UvA-DAREVitányi, P.M.B., Chater, N. (2017) Identification of probabilities.Journal of Mathematical Psychology, Vol. 76 (pp 13-24)Article | https://doi.org/10.1016/j.jmp.2016.11.004 | UvA-DAREVitányi, P.M.B., Cilibrasi, R.L. (2007) The Google similarity distance.IEEE Transactions on Knowledge & Data Engineering, Vol. 19 (pp 370-383)Article | https://doi.org/10.1109/TKDE.2007.48 | UvA-DAREVitányi, P.M.B., Cilibrasi, R.L. (2010) Normalized web distance and word similarity.In Indurkhya, N. Damerau, F.J. (Eds.), Handbook of natural language processing (pp 293-314) (Chapman & Hall/CRC machine learning & pattern recognition series). CRC Press.Vitányi, P.M.B., Gács, P., Tromp, J.A.H. (2001) Algorithmic statistics.IEEE Transactions on Information Theory, Vol. 47 (pp 2443-2463)Article | https://doi.org/10.1109/18.945257 | UvA-DAREVitányi, P.M.B., Li, M. (1995) Algorithmic arguments in physics of computation.In Proc. 4th Workshop on Algorithms and Data Structures Kingston, Ontario (pp 315-333) (Lecture Notes in Computer Science). Springer-Verlag.Chapter | UvA-DAREVitányi, P.M.B., Li, M. (1996) Reversible simulation of irreversible computation.In Proc. 11th IEEE Conference on Computational Complexity (pp 301-306)Chapter | UvA-DAREVitányi, P.M.B., Li, M. (1996) Average-Case Analysis Using Kolmogorov Complexity.In Ron Book Memorial Volume. Springer-Verlag.Chapter | UvA-DAREVitányi, P.M.B., Li, M. (1997) On prediction by data compression.In Proc. 9th European Conference on Machine Learning (pp 14-30) (Lecture Notes in Artificial Intelligence). Springer-Verlag.Chapter | UvA-DAREVitányi, P.M.B., Li, M. (2000) Minimum Description Length Induction, Baysianism, and Kolmogorov Complexity.IEEE Transactions on Information Theory, Vol. 46 (pp 446-464)Article | https://doi.org/10.1109/18.825807 | UvA-DAREVitányi, P.M.B., Li, M. (2002) Simplicity, information, Kolmogorov complexity and prediction.In Zellner, A. Keuzenkamp, H.A. Mc Aleer, M. (Eds.), Simplicity, Inference and Medelling (pp 135-155). Cambridge University Press.Chapter | UvA-DARE
The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact illc at uva.nl
