Minimum Message Length and Kolmogorov Complexity

Minimum Message Length and Kolmogorov Complexity (1999)

by C. S. Wallace , D. L. Dowe

Venue:	Computer Journal
Citations:	86 - 20 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Minimum Message Length and Kolmogorov Complexity	user correction - Legacy Corrections
AUTHOR NAME	C. S. Wallace	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science, Monash University	SVM HeaderParse 0.2
AUTHOR ADDR	Clayton Vic 3168 Australia	SVM HeaderParse 0.1
AUTHOR NAME	D. L. Dowe	SVM HeaderParse 0.1
AUTHOR AFFIL	Computer Science, Monash University	SVM HeaderParse 0.2
AUTHOR ADDR	Clayton Vic 3168 Australia	SVM HeaderParse 0.1
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]	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	Computer Journal	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	270--283	INFERENCE
VOLUME	42	INFERENCE
CITATIONS	36 found	ParsCit 1.0