B30
Lost methods and changed engineering conditions
Which constraint ended the original experiment, and when did that constraint change?

V.12 / DISCOVERY
Which change in materials, instruments or cost made an abandoned technique worth revisiting?
Recovering overlooked or repurposed work begins with a bibliographic trail and a specific question about present usefulness. Author archives such as Cormack's bibliography help distinguish an original algorithm from later implementations and informal labels. An old method earns renewed attention through a documented fit to a current task; its age or obscurity alone does not establish either value or failure.
Choose an older, documented method and a small task whose requirements are explicit. Reconstruct the original input assumptions, then compare it with a simple contemporary baseline using the same data and resource accounting. Record where the older method's constraints are beneficial, irrelevant, or incompatible with the task.
Build a recovery record for one method, including its original purpose, a reproducible comparison plan, and the evidence needed to justify renewed implementation.
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.
Andrej Bratko, Gordon V. Cormack, Bogdan Filipič, Thomas R. Lynam, and Blaž Zupan / JMLR · Compression-model-based spam classification and its evaluation setting.
B30
Which constraint ended the original experiment, and when did that constraint change?