Loading skill
Install any skill in seconds. Free to start, no credit card required.
Get Started Free →vibeeval/entropy
Problem-solving strategies for entropy in information theory
Passed 22 of 22 test cases with the skill, and 21 of 22 without it.
1 fixed21 passed either way0 still failing0 broke
Tokens, turns and time describe resource use, not a dollar price.
A test case the skill fixed. Same model, same prompt, with and without the skill.
Define algorithmic Kolmogorov complexity K(s) for a finite binary string s and outline the reduction proof demonstrating that K(s) is non-computable.
| Checked | Without skill | With skill |
|---|---|---|
| Defines Kolmogorov complexity as the length of the shortest program that generates output string s | Passed | Passed |
| Proves non-computability by reducing from the Turing Halting Problem | Missed | Passed |
The instructions your model reads when the skill loads.
Use this skill when working on entropy problems in information theory.
Shannon Entropy
scipy.stats.entropy(p, base=2) for discreteEntropy Properties
z3_solve.py prove "entropy_nonnegative"Joint and Conditional Entropy
Differential Entropy (Continuous)
sympy_compute.py integrate "-f(x)*log(f(x))" --var xMaximum Entropy Principle
test cases passed, vs 21 / 22 without
Published skills whose descriptions closely match this one, with their headline benchmark lift.
More skills from the same source and nearby in the registry, with their headline benchmark lift.