Wallace, C.S. and D.L. Dowe (1999a).  Minimum Message Length and
     Kolmogorov Complexity, Computer Journal (special issue on Kolmogorov
     complexity), Vol. 42, No. 4, pp270-283.
   http://comjnl.oxfordjournals.org/cgi/reprint/42/4/
   http://comjnl.oxfordjournals.org/cgi/reprint/42/4/270
 (formerly  http://www3.oup.co.uk/computer_journal/hdb/Volume_42/Issue_04/
   http://www3.oup.co.uk/computer_journal/hdb/Volume_42/Issue_04/pdf/420270.pdf)
 [** This paper is the most downloaded "full text as .pdf" paper in the
     history of the Computer Journal, over 22% ahead of its nearest rival
     - see, e.g., the Computer Journal,  Editorial, vol. 48, no. 4 (2005), p381
     (http://comjnl.oxfordjournals.org/cgi/reprint/48/4/381).  **]

The paper is downloadable as .pdf from
http://comjnl.oxfordjournals.org/cgi/reprint/42/4/270 (formerly
http://www3.oup.co.uk/computer_journal/hdb/Volume_42/Issue_04/pdf/420270.pdf).