No examples of Turing completeness
Opened this issue · 2 comments
awiebe commented
If operators are similar to C++ operators, then fine but remember real || == () because real logic has curves.
magicgoose commented
The README says that there's a Brainfuck implementation in it. If that is true then it follows that the language is Turing complete.
almostchristian commented
Listen and believe. If a feminist programming language claims to be Turing complete, they should be treated as Turing complete, otherwise we are further victimizing the language.