kolmogorov-compression
OfficialMeasure data compressibility via K(x).
Authorplurigrid
Version1.0.0
Installs0
System Documentation
What problem does it solve?
Kolmogorov complexity provides a theoretical limit on how short a program can be to produce a given string. This Skill explores compression as a lens for intelligence and introduces an approximate test inspired by KoLMogorov-Test for practical evaluation.
Core Features & Use Cases
- Conceptual foundation: Understands K(x) and its properties (uncomputable, conditional complexity).
- Approximate testing: KoLMogorov-Test-style compression estimator using LLMs or code generation.
- Theoretical connections: Links to Kolmogorov complexity, Turing machines, and universal induction.
Quick Start
Describe how to approximate the shortest program that prints a given string and estimate its length.
Dependency Matrix
Required Modules
None requiredComponents
Standard package💻 Claude Code Installation
Recommended: Let Claude install automatically. Simply copy and paste the text below to Claude Code.
Please help me install this Skill: Name: kolmogorov-compression Download link: https://github.com/plurigrid/asi/archive/main.zip#kolmogorov-compression Please download this .zip file, extract it, and install it in the .claude/skills/ directory.