Minimum Message Length and Kolmogorov Complexity (1999)
Cached
Download Links
- [www3.oup.co.uk]
- [www.csse.monash.edu.au]
- DBLP
Other Repositories/Bibliography
by
C. S. Wallace
,
D. L. Dowe
| Venue: | Computer Journal |
| Citations: | 125 - 29 self |
BibTeX
@ARTICLE{Wallace99minimummessage,
author = {C. S. Wallace and D. L. Dowe},
title = {Minimum Message Length and Kolmogorov Complexity},
journal = {Computer Journal},
year = {1999},
volume = {42},
pages = {270--283}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
this paper is to describe some of the relationships among the different streams and to try to clarify some of the important differences in their assumptions and development. Other studies mentioning the relationships appear in [1, Section IV, pp. 1038--1039], [2, sections 5.2, 5.5] and [3, p. 465]
