Rare card
Kolmogorov complexity
- Value
- 50 W
- Attack
- 251
- Defence
- 201
- Players
- 0
In algorithmic information theory (a subfield of computer science and mathematics), the Kolmogorov complexity of an object, such as a piece of text, is the length of a shortest computer program (in a predetermined programming language) that produces the object as output.
Get Kolmogorov complexity in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack