Algorithmic information theory
by Gregory J. Chaitin · first published 1987
4mentions
1recommended by
4HN commenters
2009–2025first – last mentioned
25% recommend75% neutral
Affiliate links. As an Amazon Associate I earn from qualifying purchases.
The one for "LISP" is an idealized Lisp that's just a step above the pure, untyped lambda calculus. See Gregory Chaitin's Algorithmic Information Theory for a slightly more detailed implementation of an ancient but pure Lisp.
on “BNF graphs for Lisp, Java, SQL, and other languages” ↗I wrote a review of Chaitin's Algorithmic Information Theory a couple of years ago. I talk briefly about his approach in using Lisp. http://blog.fogus.me/2008/12/19/bookpr0n-0-gregory-chaitins-...
on “Book review: The Limits of Mathematics by Gregory Chaitin” ↗…from Ming Li and Paul Vitányi. It is the "must-go" for the subject. An introductory chapter is available in the "Elements of Information Theory" of Thomas Cover and Joy Thomas. The field is called "Algorithmic Information Theory" and some of the big names in it are: Ray Solomonoff, Gregory Chaitin, Ming Li, Paul Vitányi, Chris Wallace, David Dowe, Markus Hutter, Jürgen Schmidhuber, Jorma Rissanen, among others. All of these guys…
on “Kolmogorov Complexity (2014) [pdf]” ↗…lambda calculus based BBλ[1] shares most of its properties. > Which immediately reminds me of Chaitin's constant which also tries to encode/talk about the properties of Turing machines, Chaitin's work on Algorithmic Information Theory (aka Kolmogorov Complexity) was actually focussed on custom Lisp languages of his own design rather than Turing Machines. One could be confused though by some of his articles on LISP program-size complexity…
on “How much math is knowable? [video]” ↗