News for hackers. Stuff that matters.

A comment on Show HN: Lambduck, a Functional Programming Brainfuck.

Re:Show HN: Lambduck, a Functional Programming Brainfuck by reuben364 on Friday June 06, 2025 @11:02AM (#44201618)
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.
[ Parent | on HN ]
Re:Show HN: Lambduck, a Functional Programming Brainfuck by jorkingit on Friday June 06, 2025 @01:42PM (#44203260)
I suspect the answer is 3: SKI combinator calculus is Turing complete and you need 3 de Bruijn indices to define S.

Good call! I got rid of all numbers above 2, I can't count that high anyway ;-)

[ Parent | on HN ]