Skip to content

other

Levin's coding theorem

Result in algorithmic information theory showing that for prefix-free machines the a priori probability of a string matches two to the minus its prefix complexity, up to a constant factor.

Known aliases

  • coding theorem

Relationships

No evidence-backed relationships are recorded.

Current clusters