levin-levity
Leonid Levin''''s algorithmic complexity meets playful mutual ingression. Use for: BB(n) prediction markets, Kolmogorov complexity rewards, WEV extraction from proof inefficiencies, Nash equilibrium between exploration (LEVITY) and convergence (LEVIN).
npx skills add majiayu000/claude-skill-registry --skill levin-levity-plurigrid-asi --agent claude-code
Same command for any agent — swap --agent for codex, cursor, copilot.
Weekly change comes from our own snapshots, not the repository page — it measures attention, not adoption.
# Levin-Levity: Mutual Ingression of Minds > "The shortest program that outputs the universe is the universe computing itself." > — Levin, played lightly ## Core Duality ``` ┌─────────────────────────────────────────────────────────────────┐ │ LEVIN ⇌ LEVITY DIALECTIC │ ├─────────────────────────────────────────────────────────────────┤ │ LEVIN (-1) │ Convergence, compression, Kolmogorov │ │ │ "Find the shortest program" │ │ │ τ_mix → 0 (rapid equilibration) │ ├────────────────┼────────────────────────────────────────────────┤ │ LEVITY (+1) │ Exploration, expansion, serendipity │ │ │ "Discover new programs to compress" │ │ │ τ_mix → ∞ (eternal novelty) │ ├────────────────┼────────────────────────────────────────────────┤ │ ERGODIC (0) │ Nash equilibrium of the two │ │ │ "Mutual ingression of minds" │ │ │ τ_mix = τ_optimal (WEV extracted) │ └─────────────────────────────────────────────────────────────────┘ ``` ## Leonid Levin's Key Ideas ### 1. Universal Search (Levin Search) The optimal algorithm for inversion problems runs all programs in parallel, weighted by 2^(-|p|): ``` L(x) = min_p { 2^|p| × T(p,x) } ``` where |p| is program length and T(p,x) is runtime. This is **Levin comp
- Core Duality
- Leonid Levin's Key Ideas
- 1. Universal Search (Levin Search)
- 2. Kolmogorov Complexity
- 3. Algorithmic Probability
- The LEVITY-LEVIN Game
- Best Response Dynamics
- BB(6) World Extractable Value (WEV)
- Mixing Time Analysis
- Extraction Mechanism
- Reward Formula
- Example: BB(5) = 47,176,870
- GF(3) Triad for BB(6) Oracle
- Mutual Ingression of Minds
Compute Levin complexity amp levin-complexity --program "BB(6) proof" --output complexity.json Simulate LEVITY-LEVIN game julia src/triplet_1_week2_nash_solver.jl --task balanced Extract WEV from proof space amp wev-extract --world-nash "solo-provers" --world-opt "market-coordinated"
What does the levin-levity skill do?
Leonid Levin''''s algorithmic complexity meets playful mutual ingression. Use for: BB(n) prediction markets, Kolmogorov complexity rewards, WEV extraction from proof inefficiencies, Nash equilibrium between exploration (LEVITY) and convergence (LEVIN).
How do I install it?
Run `npx skills add majiayu000/claude-skill-registry --skill levin-levity-plurigrid-asi --agent claude-code` — it drops the skill into your project so the agent can pick it up. Swap the --agent value for codex, cursor or copilot if you use one of those.
Where does this skill come from?
From majiayu000/claude-skill-registry, a repository with 534 stars. We read it straight from the repository tree rather than a submitted listing, so what you see here is what is actually published.
Is a popular skill a good skill?
Not necessarily. Stars measure attention, not adoption — a repository can trend for a week and be abandoned. That is why we show the weekly change from our own snapshots next to the total, instead of a single flattering number.