Paper Info
Title
Discussion of Paper 'Minimum Message Length and Kolmogorov Complexity' by C. S. Wallace and D. L. Dowe
Abstract
d the hypothesistogether, which means that (2) does not represent theidealized paradigm for the model selection problem inalgorithmic complexity that the authors apparently wereafter. In order to get that we must add the furthercondition that the joint complexity (2) agrees with K (x)up to a constant, not dependent on the length of thestring x . The resulting complexity K (y) then becomes thelength of a program representing Kolmogorov's sufficientstatistic for x [1, 2], with a meaning...
Year
DOI
Venue
1999
10.1093/comjnl/42.4.327
The Computer Journal
Keywords
Field
DocType
model selection
Minimum message length,Kolmogorov complexity,Computer science,Theoretical computer science
Journal
Volume
Issue
ISSN
42
4
0010-4620
Citations 
PageRank 
References 
0
0.34
3
Authors
2
Name
Order
Citations
PageRank
Jorma Rissanen11665798.14
David L. Dowe254655.13