go-v.orgcodex
Menu
Page tools

codex · Philosophy

Entropy compression

In mathematics and theoretical computer science, entropy compression is an information theoretic method for proving that a random process terminates, originally used by Robin Moser to prove an algorithmic version of the Lovász local lemma.

Wikipedia contributors, "Entropy compression", Wikipedia, revision 1265506670, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Philosophy · Search the codex