News for hackers. Stuff that matters.
Re:Show HN: You can program without loop and recursion and×÷... by FooBarBizBazz on Sunday July 21, 2024 @03:54PM (#41027646)
> the language is obviously (at least to me) turing-complete in the limit of the program length.

That isn't a thing.

This language can represent any function between finite sets of integers, I will believe that (proof left as exercise). But so can a lookup table.

There are no comments on this comment yet.