Kolmogorov complexity, an Uncommon card

The card carries these facts from its Wikipedia article.

• It is a measure of the computational resources needed to specify the object, and is also known as algorithmic complexity, Solomonoff–Kolmogorov–Chaitin complexity, program-size complexity, descriptive complexity, or algorithmic entropy.
• It is named after Andrey Kolmogorov, who first published on the subject in 1963 and is a generalization of classical information theory.
• The notion of Kolmogorov complexity can be used to state and prove impossibility results akin to Cantor's diagonal argument, Gödel's incompleteness theorem, and Turing's halting problem.

Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Kolmogorov complexity article was read about 110,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 78 and blocks with 56: each hit it takes is cut by 22 %.

Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.

The cards just above and just below Kolmogorov complexity in the power ranking, all domains together.