21–29 of 29 posts
Please share the interpreter’s code, however bad you feel it is.
Also, definition of de Bruijn index for those of us without formal education: https://en.m.wikipedia.org/wiki/De_Bruijn_index
Genius, great work and well done, though I might not be smart enough to do anything with it. Please share the interpreter’s code, however bad you feel it is. Also, definition of de Bruijn index for those of us without formal education: https://en.m.wikipedia.org/wiki/De_Bruijn_index
Anyhow, This is far too clear and straightforward, the bf analog to scheme would probably be unlambda, an implementation of the lambda calculus without lambda forms.
but bf is nothing like c, bf is a stack language, I would say it's closest real language analog is forth. Anyhow, This is far too clear and straightforward, the bf analog to scheme would probably be unlambda, an implementation of the lambda calculus without lambda forms. http://www.madore.org/~david/programs/unlambda/
I could guess the age of the author based on this. Seems like history gets rolled up to generalizations after a while.
but bf is nothing like c, bf is a stack language, I would say it's closest real language analog is forth. Anyhow, This is far too clear and straightforward, the bf analog to scheme would probably be unlambda, an implementation of the lambda calculus without lambda forms. http://www.madore.org/~david/programs/unlambda/
I'm not sure if I would characterize Brainfuck as a stack language, but I suppose if you considered all the operators to be unary stack operations I could see it!
Since the de Bruijn indices are limited (and presumably still Turing complete), I wonder how limited you can make them and still be Turing complete.
Good call! I got rid of all numbers above 2, I can't count that high anyway ;-)
This seems way too readable! I think you should remove the character literals in the name of purity. Also, this is likely way more compact than Brainfuck, as the lambda calculus is written essentially as usual. And seriously, very cool!
So here’s my question: is the interpreter more or less compact than a brainfuck interpreter? Which interpreter would have a lower Kolmogorov complexity, or could they be equivalent?
https://www.youtube.com/live/75PAyV83YqE?si=tQNO3IFS-y7cQeR2