Kolmogorov Complexity and MDL

7 selectedDifficulty 3-77 unseenView topic

Saved practice

Keep this quiz in your learner record

Answers count toward your profile, review queue, and next-topic suggestions. You can also use the quick practice below.

FoundationNew

0 answered

1 foundation4 intermediate2 advancedAdapts to your performance

Question 1 of 7

120sfoundation (3/10)state theorem

The Kolmogorov complexity K (x) of a string x is defined relative to a fixed universal Turing machine U . Which definition is the canonical one?