Lots of info about Lambda Calculus itself, the closely-related Combinatory Logic, and how Tromp arrived at his tiny little BLC. Pretty much a tour de force of mathematical logic.
Y_Y 1107 days ago [-]
I was about to post this masterpiece. The self interpreter is like some sort of Platonic mathematical treasure, like the Gosper Glider Gun or the Monster Group. (Please feel free to suggest other examples.)
[edit: some more off the top of my head; the Burning Ship, minimal ZFC-undecidable Turing machine[0], Milnor's 7-Sphere)
PDS: My new all-time favorite article on HN in the field of Turing Machines, Lambda Calculus, Tiny Languages, etc.
>"This program celebrates the close connection between obfuscation and conciseness, by implementing the most concise language known,
Binary Lambda Calculus (BLC)."
[...]
>"The BLC universal machine may be small at 650 bytes of C (952 bytes including layout),
but written as a self interpreter in BLC it is downright minuscule at 232 bits (29 bytes):"
[...]
>"A half byte `cat'
The shortest (closed) lambda calculus term is \x x (\ 1 in De Bruijn notation) which is the identity function. When its encoding 0010 is fed into the universal machine, it will simply copy the input to the output. (well, not that simply, since each byte is smashed to bits and rebuilt from scratch) Voila: a half byte cat:"
[...]
>"A BLC assembler
Writing BLC programs can be made slightly less painful with this parser that translates single-letter-variable lambda calculus into BLC:"
PDS: Opinion: Not just brilliant -- but insanely, utterly, astronomically brilliant!
My hat, as someone deeply interested in the fundamentals of computation, and as someone who could never accomplish what you did -- goes off to you!
Again... utterly, utterly brilliant!
tromp 1107 days ago [-]
Of related interest is this functional equivalent of the Busy Beaver function
that is more fine grained courtesy of being indexed by number of bits instead of number of states.
lifthrasiir 1108 days ago [-]
John Tromp is an active HN user and he almost surely replies to any mention to BLC or similar. I personally find Jot [1] more elegant though, where every bit sequence is a valid program. (I'm not very qualified to say which one is more compact in general however.)
> I personally find Jot [1] more elegant though, where every bit sequence is a valid program
In BLC every bit sequence is a valid program prefix, meaning it's either a complete program on its own, or we can stick another arbitrary bit on the end to get another valid program prefix.
This isn't quite as elegant as having every bit sequence be a valid program. However, I find the idea of self-delimiting programs even more elegant; which AFAIK doesn't apply to either Jot or BLC. Self-delimiting programs are like program prefixes, with an extra constraint that no program is a prefix of another. This way we can feed a parser one bit at a time (e.g. generated by tossing a coin), and if it ever forms a valid program then we can stop reading/generating bits, since there's no other program possible from that prefix. This is useful in algorithmic information theory (e.g. Kolmogorov complexity).
Does someone know where you can find the tromp program? I can't find it anywhere on the site.
tromp 1107 days ago [-]
It also features prominently on my homepage https://tromp.github.io/ as an image in a font custom designed to look good on shirts, such as the one I wear in my picture:-)
Lots of info about Lambda Calculus itself, the closely-related Combinatory Logic, and how Tromp arrived at his tiny little BLC. Pretty much a tour de force of mathematical logic.
[edit: some more off the top of my head; the Burning Ship, minimal ZFC-undecidable Turing machine[0], Milnor's 7-Sphere)
[0] https://www.scottaaronson.com/busybeaver.pdf
>"This program celebrates the close connection between obfuscation and conciseness, by implementing the most concise language known,
Binary Lambda Calculus (BLC)."
[...]
>"The BLC universal machine may be small at 650 bytes of C (952 bytes including layout),
but written as a self interpreter in BLC it is downright minuscule at 232 bits (29 bytes):"
[...]
>"A half byte `cat' The shortest (closed) lambda calculus term is \x x (\ 1 in De Bruijn notation) which is the identity function. When its encoding 0010 is fed into the universal machine, it will simply copy the input to the output. (well, not that simply, since each byte is smashed to bits and rebuilt from scratch) Voila: a half byte cat:"
[...]
>"A BLC assembler Writing BLC programs can be made slightly less painful with this parser that translates single-letter-variable lambda calculus into BLC:"
PDS: Opinion: Not just brilliant -- but insanely, utterly, astronomically brilliant!
My hat, as someone deeply interested in the fundamentals of computation, and as someone who could never accomplish what you did -- goes off to you!
Again... utterly, utterly brilliant!
https://oeis.org/A333479
that is more fine grained courtesy of being indexed by number of bits instead of number of states.
[1] https://en.wikipedia.org/wiki/Iota_and_Jot#Jot
In BLC every bit sequence is a valid program prefix, meaning it's either a complete program on its own, or we can stick another arbitrary bit on the end to get another valid program prefix.
This isn't quite as elegant as having every bit sequence be a valid program. However, I find the idea of self-delimiting programs even more elegant; which AFAIK doesn't apply to either Jot or BLC. Self-delimiting programs are like program prefixes, with an extra constraint that no program is a prefix of another. This way we can feed a parser one bit at a time (e.g. generated by tossing a coin), and if it ever forms a valid program then we can stop reading/generating bits, since there's no other program possible from that prefix. This is useful in algorithmic information theory (e.g. Kolmogorov complexity).
https://tromp.github.io/cl/diagrams.html
And a picture of Graham’s number.
https://mindsarentmagic.org/2020/02/19/a-picture-of-grahams-...