Skip Navigation

The Computer Journal 1999 42(4):338-339; doi:10.1093/comjnl/42.4.338
© 1999 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Clarke, B.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Discussion of the Papers by Rissanen, and by Wallace and Dowe

B. ClarkeA1

A1 Department of Statistics, UBC, 6356 Agricultural Road, Room 333, Vancouver, BC, Canada, U6T 1Z2 Email: bertrand@stat.ubc.ca

Commenting on the papers by Dr Rissanen and Professors Wallace and Dowe is a daunting sort of pleasure. Superficially, the papers are not closely related: Dr Rissanen has focused on the Shtarkov optimality criterion in a minimum description length (MDL) context giving some new implications from normalization (see his equation (1)) for model selection and hypothesis testing. By contrast, Wallace and Dowe have given a first, and welcome, effort to axiomatize a setting in which it is reasonable to hope that the algorithmic complexity approaches of Kolmogorov and Solomonoff—streams one and two, using UTMs—may coincide with the Shannon theory approaches—stream three in its minimum message length (MML) and MDL versions. Despite these differences, there are several senses in which these two papers are closely related.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.