B09
Prediction, coding, and learning
When does shorter code length predict better classification on new examples?

IV.14 / AI
Which early publications match the description of dynamic Markov compression, and what do their algorithms and bibliographies identify?
The label Nigel compression remains an identity-resolution question in this atlas. Cormack's author bibliography provides a documented route to Dynamic Markov Compression, which should be studied under its actual authorship and publication record. The immediate task is to establish whether the informal label refers to that work, a different algorithm, a person's implementation, or a transcription error before joining their histories.
Create separate records for the informal label and each candidate publication. Compare title, authors, year, venue, algorithm description, and any supplied code. A shared word such as Markov or compression is insufficient on its own; a matching citation or implementation history would provide a concrete link.
Obtain the original occurrence of the Nigel label, preserve its context, and test it against the documented compression bibliography before merging any records.
These models isolate a mechanism you can vary. Their assumptions define the part of this topic they can illuminate.
Change one parameter, compare the numerical output, and export the result. The experiment loads when you open it.
Compare symbol frequencies with the ordering that a code can exploit.
The first sweep changes the probability of A while drawing each symbol independently. The other three symbols share the remaining probability.
As one symbol dominates, the observed symbol entropy falls. Huffman codes use short words for frequent symbols; the comparison excludes headers and the codebook.
The second sweep gives all four new draws equal probability and increases repetition. Long runs reward run-length coding, even when a symbol histogram cannot describe the dependence.
Method. The histogram gives an order-zero Shannon entropy. Huffman coding repeatedly joins the two least frequent branches to build a prefix code. The run-length format stores a two-bit symbol and an eight-bit count; counts run from 1 to 255, and a longer run uses another packet.
Gordon V. Cormack / University of Waterloo · Bibliographic identity of Dynamic Markov Compression work; does not resolve the separate 'Nigel' label.
B09
When does shorter code length predict better classification on new examples?
B29
At the same accuracy, how much memory and energy does each representation require?
B30
Which constraint ended the original experiment, and when did that constraint change?