| Display title | Kolmogorov complexity |
| Default sort key | Kolmogorov Complexity |
| Page length (in bytes) | 55,421 |
| Namespace ID | 0 |
| Page ID | 224284 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>DanMescoff |
| Date of page creation | 23:59, 6 February 2024 |
| Latest editor | imported>DanMescoff |
| Date of latest edit | 23:59, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | 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. It is a measure of the computational... |
