4 ms·
It makes for an interesting-sounding title, but: > This is simply Brainfuck with operators that are legal in (Debian) version numbers kept as-is, and some numb
by OJFord 7y ago
It makes for an interesting-sounding title, but:
> This is simply Brainfuck with operators that are legal in (Debian) version numbers kept as-is, and some numbers replacing the rest.
Is it known to be (or else what is) a minimum number of such operators for Turing completeness?
I ended the post thinking that was the more interesting question, but now that I comment, I wonder if that's even meaningful without restricting what it means to be an 'operator' - 6 and 9 from the OP are quite convoluted for example.
- greyfade 7y agoYes. https://en.wikipedia.org/wiki/One_instruction_set_computer https://en.wikipedia.org/wiki/One_instruction_set_computer
- tromp 7y agoCombinatory logic [1] is universal and needs only 2 primitive combinators, S and K, as well as an application operator. So 3 operators suffice for completeness without any convoluting. [1] https://en.wikipedia.org/wiki/Combinatory_logic https://en.wikipedia.org/wiki/Combinatory_logic