← Library

2026-01-08

6 saved articles

  1. From Entropy to Epiplexity: Rethinking Information for Computationally Bounded Intelligence

    [Submitted on 6 Jan 2026 (v1), last revised 16 Mar 2026 (this version, v2)] · arXiv.org

    Can we learn more from data than existed in the generating process itself? Can new and useful information be constructed from merely applying deterministic transformations to existing data? Can the learnable content in data be evaluated without considering a downstream task? On these questions, Shannon information and Kolmogorov complexity come up nearly empty-handed, in part because they assume observers with unlimited computational capacity and do not target the useful information content. In

  2. Gleam programming language

    gleam.run

    Discover a friendly language for scalable, type-safe systems. Gleam comes with compiler, build tool, formatter, editor integrations, and package manager all built in.