External Links

    Journal: Comput. J.

    Volume 42, Issue 4

    252 -- 255Alexander Gammerman, Vladimir Vovk. Kolmogorov Complexity: Sources, Theory and Applications
    256 -- 259Ray J. Solomonoff. Two Kinds of Probabilistic Induction
    260 -- 269Jorma Rissanen. Hypothesis Selection and Testing by the MDL Principle
    270 -- 283Chris S. Wallace, David L. Dowe. Minimum Message Length and Kolmogorov Complexity
    284 -- 286Leonid A. Levin. Robust Measures of Information
    287 -- 293Tao Jiang, Ming Li, Paul M. B. Vitányi. New Applications of the Incompressibility Method
    294 -- 317Vladimir V. V yugin. Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
    318 -- 322Vladimir Vovk, Alexander Gammerman. Complexity Approximation Principle
    323 -- 326A. P. Dawid. Discussion of the Papers by Rissanen and by Wallace and Dowe
    327 -- 329Jorma Rissanen. Discussion of Paper Minimum Message Length and Kolmogorov Complexity by C. S. Wallace and D. L. Dowe
    330 -- 337Chris S. Wallace, David L. Dowe. Refinements of MDL and MML Coding
    338 -- 339B. Clarke. Discussion of the Papers by Rissanen, and by Wallace and Dowe
    340 -- 342Alexander Shen. Discussion on Kolmogorov Complexity and Statistical Analysis
    343 -- 344Jorma Rissanen. Rejoinder
    345 -- 347Chris S. Wallace, David L. Dowe. Rejoinder
    runs on