Single-pass Adaptive Image Tokenization for Minimum Program Search | What's the Kolmogorov Complexity of an Image?
-
Updated
Jul 26, 2025 - Jupyter Notebook
Single-pass Adaptive Image Tokenization for Minimum Program Search | What's the Kolmogorov Complexity of an Image?
Python implementation of block decomposition method for approximating algorithmic complexity
Repository for the Online Algorithmic Complexity Calculator
An Algorithmic Information Theory Library (And Information-theory broadly); Implements numerous approximations, estimations, as well as a comprehensive MC-AIXI Agent & Model Ensemble platform.
Repository for the Online Algorithmic Complexity Calculator
Official code repository for ICML'23 paper On the Complexity of Bayesian Generalization.
An agent that searches for novel quantum universal gate set
Algorithmic Information Dynamics with the R Language
Introducing Lossless Agentic Compression. We introduce a method, and codebase, for losslessly compressing files using (generative) AI Agents, and explore the implications that come with this. Furthermore, we propose a definition and generalizable measure of intelligence, extending classic works.
Python research toolkit for structure-fair quantum circuit complexity: build and audit finite-control models, verify reference certificates, and compute conditional lower bounds from terminal-state information.
Visualizing Quantum Circuit Probability
A small program to explore Normalized Web Distance (NWD) with NCD
Informational interpretation of quantum mechanics, gravity, and cosmology based on coherence-driven compression. Includes a falsifiable adaptive-interference protocol.
Python implementation of block decomposition method for approximating algorithmic complexity
Complete Implementation of Matt Mahoneys paper: "A Proposed Design for Distributed Artificial General Intelligence", Version 2.2. P2P Competitive Message Routing via approximated Kolmogorov Complexity.
Normalized Compression Distance in POSIX shell, and compatible with any compressor.
Undecidable connectivity of computable fractal limit sets: Pi01-completeness, an Omega-comb encoding Chaitin's Omega, no computable critical scale, and provability thresholds set by K(F) (Paper 6)
Algorithmic Information Theory Project - Reduce complexity with prime numbers
Code, data, figures and manuscript for "Uncomputable Fractal Dimensions, Kolmogorov Complexity Cascades, and the Chaitin Barrier in Physical Systems" (R. Chen, 2026).
To associate your repository with the algorithmic-information-theory topic, visit your repo's landing page and select "manage topics."