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

Minimum Description Length Recurrent Neural Networks (MDLRNNs) in PyTorch

Repository for the Online Algorithmic Complexity Calculator

Minimum Description Length Recurrent Neural Networks

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.

(TODO) actually callable javascript lambdas of infinitely threadable (potentially massively-multiplayer) godel-like-numbering-secure low latency neuralnet approximation of hypercomputation of the iota combinator sparse-emulating debugger breakpoints of itself, in javascript lambdas, such as naming every possible lambda by a 256 bit merkle id

Computational predictions of protein attributes associated with COVID-19 using Data Science techniques

Estimate the Kolmogorov complexity of grayscale images and weighted graphs

A small Julia library for calculating the normalized compression distance.

Estimation of the robustness of networks to attacks directed using Kolmogorov complexity as estimated by the Block Decomposition Method.

Minimum Description Length Hopfield Networks

Introducing Lossless Agentic Compression. We introduce a method, and codebase, for losslessly compressing files using AI Agents, and explore the implications that come with this. Furthermore, we propose a definition and generalizable measure of intelligence, extending classic works.

In Kolmogorov's sense of complexity, conditional complexity allows to take some background knowledge into account for description complexity. Can this concept be applied to image recognition? I did a quick experiment to try to highlight this process in the context of image recognition.

Python code analysis engine built on Mathematical Contrapuntalism — security + quality dissonance detection using generating functions, Banach convergence, and path-sensitive taint analysis.

Python code to implement an efficient approach to unsupervised OOD detection with VAE

Python implementation of block decomposition method for approximating algorithmic complexity

Write the shortest possible programs to generate given strings

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.