The Computer Journal

Volume 42 Number 4
Special Issue on Kolmogorov Complexity, A.Gammerman and V.Vovk (eds), Springer, 1999
Oxford University Press for the British Computer Society, 1999

Contents

Editorial - Kolmogorov complexity
A. Gammerman and V. Vovk

Kolmogorov complexity: sources, theory and application
A. Gammerman and V. Vovk

Two kinds of probabilistic induction
R. Solomonoff

Hypothesis selection and testing by the MDL principle
J. Rissanen

Minimum message length and Kologorov complexity
C.S. Wallace and D.L. Dowe

Robust measures of information
L A. Levin

New applications of the incompressibility method
T. Jiang, M. Li and P. Vitanyi

Algorithmic complexity and stochastic properties of finite binary sequences
V. V. V'yugin

Complexity approximation principle
V. Vovk and A. Gammerman

Discussion of the papers by Rissanen and by Wallace and Dowe
A.P. Dawid

Discussion of paper 'Minimum message length and Kolmogorov complexity' by C.S.Wallace and D.L. Dowe
J. Rissanen

Refinements of MDL and MML coding
C.S. Wallace and D.L. Dowe

Discussion of the papers by Rissanen and by Wallace and Dowe
B. Clarke

Discussion on Kolomogorov complexity and statistical analysis
A. Shen

Rejoinder
J. Rissanan

Rejoinder
C.S. Wallace and D.L. Dowe