uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • Vitá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)
  • Vitá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
  • Vitányi, P.M.B., Verschaging, N. (2003) Kolmogorov's structure functions, nonprobabilistic statistics and the foundation of model selection.
    In Proceedings IEEE International symposium on information theory (pp 286-286)
    Conference contribution | UvA-DARE
  • Vitányi, P.M.B. (1994) Randomness.
    In Schrijver, A. Apt, K.R. Temme, N. (Eds.), From Universal morphisms to megabytes: a Baayen space Odyssey. CWI.
    Chapter | UvA-DARE
  • Vitányi, P.M.B. (1994) Multiprocessor architectures and physical law.
    In Matzke (Eds.), Proc. 2nd IEEE Workshop on Physics and Computation, PhysComp'94 (pp 24-29). IEEE.
    Chapter | UvA-DARE
  • Vitányi, P.M.B. (1995) Physics and the New Computation.
    In Proc. 20th Int. Symp. Math. Foundations of Computer Science, MFCS'95 (pp 106-128) (Lecture Notes in Computer Science). Springer-Verlag.
    Chapter | UvA-DARE
  • Vitányi, P.M.B. (1995) Computational learning theory: second European conference, EuroCOLT '95, Barcelona, Spain, March 13-15, 1995: proceedings.
    Lecture notes in computer science. Springer.
  • Vitányi, P.M.B. (1996) Genetic fitness optimization using rapidly mixing Markov chains.
    In Proc. 7th Int'nl Workshop on Algorithmic Learning Theory (pp 67-82) (Lecture Notes in Artificial Intelligence). Springer-Verlag.
    Chapter | UvA-DARE
  • Vitányi, P.M.B. (1997) Physics of computation and the quantum computing challenge.
    NVTI Bulletin
    Article | UvA-DARE
  • Vitányi, P.M.B. (1998) Minimum Description Length Inductin, Bayesianism.
    In IEEE Int. Symposium on Information Theory (-). MIT Press.
    Chapter | UvA-DARE
  • Vitányi, P.M.B. (1998) Randomized naming using wait free shared variables.
    Distributed Computing, Vol. 11- (pp 113-124)
  • Vitányi, P.M.B. (1998) Reversible simulation of irreversible computation.
    Physica D, Vol. 120 (pp 168-176)
  • Vitányi, P.M.B. (1998) Information distance.
    IEEE Transactions on Information Theory, Vol. 44 (pp 1407-1423)
  • Vitányi, P.M.B. (1999) The Erdos graph and the beast.
    Mathematical Intelligencer, Vol. 21 (pp 54-55)
    Article | UvA-DARE
  • Vitányi, P.M.B. (2000) The quantum computing challenge.
    Lecture Notes in Computer Science, Vol. 2000 (pp 219-233)
    Article | UvA-DARE
  • Vitányi, P.M.B. (2000) A discipline of evolutionary programming.
    Theoretical Computer Science, Vol. 241 (pp 3-23)
  • Vitányi, P.M.B. (2000) Three Approaches to the Quantitative Definition of Information in Individual Pure Quantum State.
    In Proceedings 15th IEEE Conference on Computational Complexity (pp 263-270)
    Conference contribution | UvA-DARE
  • Vitányi, P.M.B. (2001) Quantum kolmogorov complexity based on classical descriptions.
    IEEE Transactions on Information Theory, Vol. 47 (pp 2464-2479)
  • Vitányi, P.M.B. (2001) Turingmachine gaat nog duizend jaar mee.
    Automatiserings Gids (pp 19-19)
    Article | UvA-DARE
  • Vitányi, P.M.B. (2002) Simple wait-free multireader register.
    Lecture Notes in Computer Science, Vol. 2508 (pp 118-132)
    Article | UvA-DARE
1 ... 290 291 292 293 294 295 296 297 298 ... 309

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