Computability

• Kolmogorov Complexity and Algorithmic Information Theory: The Deepest Measure of Information · 2025-07-30

  Dive into algorithmic information theory: Kolmogorov complexity as the ultimate measure of information content, its relationship to randomness (Martin-Löf tests), the incompressibility method for proving lower bounds, and the philosophical implications for science and mathematics.

• The Lambda Calculus and Combinatory Logic: The Minimalist Foundations of All Computation · 2025-05-06

  Rediscover the lambda calculus as the essence of computation: Church's elegant system of function definition and application, its equivalence to Turing machines, the fixed-point combinator, and its enduring influence on programming languages from Lisp to Haskell.

• On Computable Numbers, with an Application to the Entscheidungsproblem