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.
Visualizing Quantum Circuit Probability
Informational interpretation of quantum mechanics, gravity, and cosmology based on coherence-driven compression. Includes a falsifiable adaptive-interference protocol.
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.
A small program to explore Normalized Web Distance (NWD) with NCD
Python implementation of block decomposition method for approximating algorithmic complexity
Capture the Heap state at specified intervals, and measure the compressed size thereof.
Algorithmic Information Theory Project - Reduce complexity with prime numbers
The Library: The Indifference of Description — Vol III of the Indifference suite. Algorithmic information theory followed to a single claim: there are no joints, only the cuts you make.
A lay-readable book on the mathematics of optimal intelligence (Bayes, Solomonoff induction, AIXI), the specification problem, and what they imply about modern AI and alignment.
A machine-checked formalization of AIXI in Lean 4. Bellman optimality, the infinite-horizon fixed-point equation, and a complexity-weighted universal environment.
Add a description, image, and links to the algorithmic-information-theory topic page so that developers can more easily learn about it.
To associate your repository with the algorithmic-information-theory topic, visit your repo's landing page and select "manage topics."